CONCUR ’96: Concurrency Theory: 7th International Conference Pisa, Italy, August 26–29, 1996 Proceedings

Samson Abramsky (auth.), Ugo Montanari, Vladimiro Sassone (eds.)3540616047, 9783540616047

This book constitutes the refereed proceedings of the 7th International Conference on Concurrency Theory, CONCUR ’96, held in Pisa, Italy, in August 1996.
The volume presents 37 revised full papers selected from a total of 133 submissions; also included are seven invited papers. The contributions are grouped into topical sections on process algebras, categorical approaches, the pi-calculus, decidability and complexity, probability, functional and constraint programming, Petri nets, verification, automata and causality, practical models, and shared-memory systems.

---

Table of contents :
Retracing some paths in process algebra….Pages 1-17
Process calculus based upon evaluation to committed form….Pages 18-33
A process algebra with distributed priorities….Pages 34-49
Symbolic transition graph with assignment….Pages 50-65
Models for concurrent constraint programming….Pages 66-83
Comparing transition systems with independence and asynchronous transition systems….Pages 84-97
A presheaf semantics of value-passing processes….Pages 98-114
Elementary control structures….Pages 115-130
On transformations of concurrent object programs….Pages 131-146
On bisimulations for the asynchronous π-calculus….Pages 147-162
On the expressiveness of internal mobility in name-passing calculi….Pages 163-178
Decoding choice encodings….Pages 179-194
Infinite results….Pages 195-216
Decidability of bisimulation equivalence for normed pushdown processes….Pages 217-232
The modal mu-calculus alternation hierarchy is strict….Pages 233-246
Bisimulation collapse and the process taxonomy….Pages 247-262
On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic….Pages 263-277
A Facile tutorial….Pages 278-298
Testing probabilistic automata….Pages 299-314
Extended Markovian Process Algebra….Pages 315-330
Rewriting logic as a semantic framework for concurrency: a progress report….Pages 331-372
Truly concurrent constraint programming….Pages 373-388
Constraints as processes….Pages 389-405
A calculus of mobile agents….Pages 406-421
Algebraic interpretation of lambda calculus with resources….Pages 422-437
Concurrent graph and term graph rewriting….Pages 438-464
Petri boxes and finite precedence….Pages 465-480
Constrained properties, semilinear systems, and Petri nets….Pages 481-497
Linear constraint systems as high-level nets….Pages 498-513
A space-efficient on-the-fly algorithm for real-time model checking….Pages 514-529
State equivalences for rectangular hybrid automata….Pages 530-545
Verifying abstractions of timed systems….Pages 546-562
Towards automatic temporal logic verification of value passing process algebra using abstract interpretation….Pages 563-578
Modelling and verification of Distributed Algorithms….Pages 579-595
An algorithmic approach for checking closure properties of Ω-regular languages….Pages 596-610
Towards automata for branching time and partial order….Pages 611-626
Asynchronous cellular automata for pomsets without auto-concurrency….Pages 627-638
Action refinement and property inheritance in systems of sequential agents….Pages 639-654
A calculus for concurrent objects….Pages 655-670
Refinement in Interworkings….Pages 671-686
Equivalences of Statecharts….Pages 687-702
Modular verification for shared-variable concurrent programs….Pages 703-718
The impact of hardware models on shared memory consistency conditions….Pages 719-734
Synchronous development of asynchronous systems….Pages 735-750