CONCUR'97: Concurrency Theory

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.