CONCUR’98 Concurrency Theory: 9th International Conference Nice, France, September 8–11, 1998 Proceedings

Moshe Y. Vardi (auth.), Davide Sangiorgi, Robert de Simone (eds.)3540648968, 9783540648963

This book constitutes the refereed proceedings of the 9th International Conference on Concurrency Theory, CONCUR’98, held in Nice, France, in September 1998.
The 35 revised full papers presented were carefully selected from a total of 104 submissions. Also presented are five invited contributions. Among the topics covered are moduls of computation and semantic domains, process algebras, Petri Nets, event structures, real-time systems, hybrid systems, model checking, verification techniques, refinement, rewriting, typing systems and algorithms, etc..

---

Table of contents :
Sometimes and not never re-revisited: on branching versus linear time….Pages 1-17
Controllers for discrete event systems via morphisms….Pages 18-33
Synthesis from knowledge-based specifications….Pages 34-49
The regular viewpoint on PA-processes….Pages 50-66
Herbrand automata for hardware verification….Pages 67-83
Control flow analysis for the π-calculus….Pages 84-98
The tau-laws of fusion….Pages 99-114
From higher-order π-calculus to π-calculus in the presence of static operators….Pages 115-130
Minimality and separation results on asynchronous mobile processes….Pages 131-146
Abstract games for infinite state processes….Pages 147-162
Alternating refinement relations….Pages 163-178
Possible worlds process algebras….Pages 179-193
Automata and coinduction (an exercise in coalgebra)….Pages 194-218
Axioms for real-time logics….Pages 219-236
Priority and maximal progress are completely axiomatisable (extended abstract)….Pages 237-252
Simulation is decidable for one-counter nets….Pages 253-268
From rewrite to bisimulation congruences….Pages 269-284
Reasoning about asynchronous communication in dynamically evolving object structures….Pages 285-300
Modelling IP mobility….Pages 301-316
Reduction in TLA….Pages 317-331
Detecting deadlocks in concurrent systems….Pages 332-347
Unfold/fold transformations of CCP programs….Pages 348-363
Type systems for concurrent calculi….Pages 364-365
Stochastic process algebras benefits for performance evaluation and challenges….Pages 366-372
Algebraic techniques for timed systems….Pages 373-388
Probabilistic resource failure in real-time process algebra….Pages 389-404
Towards performance evaluation with general distributions in process algebras….Pages 405-422
Stochastic transition systems….Pages 423-438
It’s about time: Real-time logics reviewed….Pages 439-454
Controlled timed automata….Pages 455-469
On discretization of delays in timed automata and digital circuits….Pages 470-484
Partial order reductions for timed systems….Pages 485-500
Unfolding and finite prefix for nets with read arcs….Pages 501-516
Asynchronous cellular automata and asynchronous automata for pomsets….Pages 517-532
Deriving unbounded Petri nets from formal languages….Pages 533-548
Decompositions of asynchronous systems….Pages 549-564
Synthesis of ENI-systems using minimal regions….Pages 565-580
A categorical axiomatics for bisimulation….Pages 581-596
Fibrational semantics of dataflow networks….Pages 597-612
A relational model of non-deterministic dataflow….Pages 613-628
Checking verifications of protocols and distributed systems by computer….Pages 629-655