Abstract is missing.
- The Lambda-Calculus with Multiplicities (Abstract)Gérard Boudol. 1-6
- A Multiset Semantics for the pi-Calculus with ReplicationJoost Engelfriet. 7-21
- Model Checking Mobile ProcessesMads Dam. 22-36
- A Practical Technique for Process AbstractionGlenn Bruns. 37-49
- Modular Completeness for Communication Closed LayersMaarten M. Fokkinga, Mannes Poel, Job Zwiers. 50-65
- The Linear Time - Branching Time Spectrum IIRob J. van Glabbeek. 66-81
- A Classification of Models for ConcurrencyVladimiro Sassone, Mogens Nielsen, Glynn Winskel. 82-96
- On the Ill-Timed but Well-CausedLuca Aceto, David Murphy. 97-111
- On the Reduction of Chocs Bisimulation to pi-Calculus BisimulationRoberto M. Amadio. 112-126
- A Theory of Bisimulation for the pi-CalculusDavide Sangiorgi. 127-142
- Bisimulation Equivalence is Decidable for Basic Parallel ProcessesSøren Christensen, Yoram Hirshfeld, Faron Moller. 143-157
- A pi-Calculus Semantics for an Object-Based Design NotationCliff B. Jones. 158-172
- Programming with BroadcastsK. V. S. Prasad. 173-187
- Interpreting Broadcast Communication in SCCSUno Holmer. 188-201
- Proof Systems for Message-Passing Process AlgebrasMatthew Hennessy, H. Lin. 202-216
- Refinement and Decomposition of Value-Passing Action SystemsMichael J. Butler. 217-232
- Partial-Order Methods for Temporal VerificationPierre Wolper, Patrice Godefroid. 233-246
- Model Construction for Implicit Specifications in Model LogicOle Høgh Jensen, Jarl Tuxen Lang, Christian Jeppesen, Kim Guldstrand Larsen. 247-261
- Branching Time Temporal Logic and Amorphous Tree AutomataOrna Bernholtz, Orna Grumberg. 262-277
- A Generalized Event Structure for the Muller Unfolding of a Safe NetJeremy Gunawardena. 278-292
- Domains of Higher-Dimensional AutomataEric Goubault. 293-307
- Non Interleaving Process AlgebraJos C. M. Baeten, Jan A. Bergstra. 308-323
- Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract)Roberto Segala. 324-338
- Two Fully Abstract Models for UNITYRob T. Udink, Joost N. Kok. 339-352
- Transformations Preserving Properties and Properties Preserved by Transformations in Fair Transition Systems (Extended Abstract)Shengzong Zhou, Rob Gerth, Ruurd Kuiper. 353-367
- Minimal Memory Schedules for Dataflow NetworksMarija Cubric, Prakash Panangaden. 368-383
- Networks of Real-Time ProcessesRobert Kim Yates. 384-397
- Loop Parallelization in the Polytope ModelChristian Lengauer. 398-416
- ACSR: An Algebra of Communicating Shared Resources with Dense Time and PrioritiesPatrice Brémond-Grégoire, Insup Lee, Richard Gerber. 417-431
- An Elimination Theorem for Regular Behaviours with IntegrationWan Fokkink. 432-446
- A Linear Local Model Checking Algorithm for CTLBart Vergauwen, Johan Lewi. 447-461
- Local Event Structures and Petri NetsP. W. Hoogers, H. C. M. Kleijn, P. S. Thiagarajan. 462-476
- A Congruence Theorem for Structured Operational Semantics with PredicatesJos C. M. Baeten, Chris Verhoef. 477-492
- From CML to Process Algebras (Extended Abstract)Flemming Nielson, Hanne Riis Nielson. 493-508
- Types for Dynamic InteractionKohei Honda. 509-523
- Principal Typing Schemes in a Polyadic pi-CalculusVasco Thudichum Vasconcelos, Kohei Honda. 524-538
- Structured Operational Sematics for Process Algebras and Equational Axiom SystemsBard Bloom. 539-540