CONCUR '97: Concurrency Theory. Lecture Notes in Computer Science, 1243

Antoni Mazurkiewicz & Jozef Winkowski, Eds.

ISBN 10: 3540631410 / ISBN 13: 9783540631415

Editore: Springer, 1997

Riguardo questo articolo

420 pp., softcover, ex library, else text clean & binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Codice articolo ZB378253

Dati bibliografici

• Titolo: CONCUR '97: Concurrency Theory. Lecture Notes in Computer Science, 1243
• Editore: Springer
• Data di pubblicazione: 1997
• ISBN 10: 3540631410
• ISBN 13: 9783540631415
• Condizione: Good

Descrizione articolo

Riassunto

This book constitutes the refereed proceedings of the 8th International Conference on Concurrency Theory, CONCUR'97. held in Warsaw, Poland, in July 1997.
The 24 revised full papers presented were selected by the program committee for inclusion in the volume from a total of 41 high-quality submissions. The volume covers all current topics in the science of concurrency theory and its applications, such as reactive systems, hybrid systems, model checking, partial orders, state charts, program logic calculi, infinite state systems, verification, and others.

Contenuti

Recent developments in the mathematics of reactive systems (extended abstract).- Partial-order reduction in the weak modal mu-calculus.- Cyclic vector languages.- A product version of dynamic linear time temporal logic.- Reasoning about cryptographic protocols in the spi calculus.- Modularity for timed and hybrid systems.- A universal reactive machine.- Bounded stacks, bags and queues.- Adding partial orders to linear temporal logic.- Reachability analysis of pushdown automata: Application to model-checking.- Synthesis of nets with inhibitor arcs.- An algebraic theory of multiple clocks.- Horizontal and vertical structuring techniques for statecharts.- Implicit typing à la ML for the join-calculus.- Proving safety properties of infinite state systems by compilation into Presburger arithmetic.- Axiomatizing flat iteration.- Probabilistic concurrent constraint programming.- On the complexity of verifying concurrent transition systems.- Fair simulation.- High level expressions with their SOS semantics.- How to Parallelize sequential processes.- Causal ambiguity and partial orders in event structures.- Model checking PA-processes.- Bisimulation and propositional intuitionistic logic.- A rigorous analysis of concurrent operations on B-trees.- First-order axioms for asynchrony.- On implementations and semantics of a concurrent programming language.- Algebraic characterization of petri net pomset semantics.