Abstract is missing.
- Processes as Data Types: Observational Semantics and LogicEgidio Astesiano, Alessandro Giovini, Gianna Reggio. 1-20
- Metric Pomset Semantics for a Concurrnt Language with RecursionJ. W. de Bakker, J. H. A. Warmerdam. 21-49
- Fault-Tolerant Naming and Mutual ExclusionJoffroy Beauquier. 50-61
- Flow Event Structures and Flow NetsGérard Boudol. 62-95
- Three Equivalent Semantics for CCSGérard Boudol, Ilaria Castellani. 96-141
- Towards a Semantic Approach to SIMD Architectures and their LanguagesLuc Bougé, Patrick Garda. 142-175
- Concerning the Size of ClocksBernadette Charron-Bost. 176-184
- Transition Systems with Algebraic Structure as Models of ComputationsAndrea Corradini, Gian Luigi Ferrari, Ugo Montanari. 185-222
- Concurrency and ComputabilityPhilippe Darondeau. 223-238
- Causal Trees: Interleaving + CausalityPhilippe Darondeau, Pierpaolo Degano. 239-255
- Partially Commutative Formal Power SeriesGérard Duchamp, Daniel Krob. 256-276
- Infinite TracesPaul Gastin. 277-308
- Equivalences and RefinementRob J. van Glabbeek, Ursula Goltz. 309-333
- CCS and Petri NetsUrsula Goltz. 334-357
- About Fixpoints for ConcurrencyIrène Guessarian. 358-374
- Observers, Experiments and Agents: a Comprehensive Approach to ParallelismStefano Kasangian, Anna Labella, Alberto Pettorossi. 375-406
- Action versus State based Logics for Transition SystemsRocco De Nicola, Frits W. Vaandrager. 407-419
- Approaching Fair Computations by Ultra MetricsLutz Priese. 420-433
- On Distributed Languages and Models for Distributed ComputationBrigitte Rozoy. 434-456