Structures in Concurrency Theory -

Structures in Concurrency Theory

Proceedings of the International Workshop on Structures in Concurrency Theory (STRICT), Berlin, 11–13 May 1995

Jörg Desel (Herausgeber)

Buch | Softcover
X, 352 Seiten
1995 | 1. Softcover reprint of the original 1st ed. 1995
Springer Berlin (Verlag)
978-3-540-19982-3 (ISBN)
53,49 inkl. MwSt
This book is the proceedings of the Structures in Concurrency Theory workshop (STRICT) that was held from 11 th to l3th May 1995 in Berlin, Germany. It includes three invited contributions - by J. de Bakker, E. Best et aI, and E. R. Olderog and M. Schenke - and all papers which were submitted and accepted for presentation. Concurrency Theory deals with formal aspects of concurrent systems. It uses partly competing and partly complementary formalisms and structures. The aim of this workshop was to present and compare different formalisms and results in Concurrency Theory. STRICT was organized by the Humboldt-University Berlin and the ESPRIT Basic Research Working Group CALIBAN. Original papers had been sought from all scientists in the field of Concurrency Theory. The Programme Committee selected twenty contributions with various different topics, including Petri Nets, Process Algebras, Distributed Algorithms, Formal Semantics, and others. I am grateful to the Programme Committee and to the other referees for the careful evaluation of the submitted papers.

The Three Dimensions of Semantics.- CALIBAN - Esprit Basic Research WG 6067.- Design of Real-Time Systems: Interface Between Duration Calculus and Program Specifications.- Conformance: A Precongruence Close to Bisimilarity.- On the Synchronic Structure of Transition Systems.- An M-Net Semantics of B(PN)2.- Graphs for Generalized Traces.- Orbits, Half-Frozen Tokens and the Liveness of Weighted Circuits.- An Observational Semantics for Linda.- Refinement and Recursion in a High Level Petri Box Caluculus.- Sequentiality by Linear Implication and Universal Quantification.- Linear Space Algorithm for On-Line Detection of Global Predicates.- A Simple Decision Method for the Linear Time Mu-Calculus.- Message Passing Mutex.- Possible and Guaranteed Concurrency in CSP.- Metric Completion Versus Ideal Completion.- Keeping Track of the Latest Gossip in Message-Passing Systems.- A Local Presentation of Synchronizing Systems.- On Well-Formedness Analysis: The Case of Deterministic Systems of Sequential Processes.- An Event-Based SOS for a Language with Refinement.- On the Computation of Place Invariants for Algebraic Petri Nets.- Failure-Based Equivalences Are Faster Than Many Believe.- Partial Order Semantics and Weak Fairness.- Author Index.

Erscheint lt. Verlag 13.10.1995
Reihe/Serie Workshops in Computing
Zusatzinfo X, 352 p. 5 illus.
Verlagsort London
Sprache englisch
Maße 155 x 235 mm
Gewicht 565 g
Themenwelt Mathematik / Informatik Informatik Betriebssysteme / Server
Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Analysis
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte Algebra • Calculus • Concurrency • Recursion
ISBN-10 3-540-19982-9 / 3540199829
ISBN-13 978-3-540-19982-3 / 9783540199823
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich