Abstract is missing.
- Retracing Some Paths in Process AlgebraSamson Abramsky. 1-17
- Process Calculus Based upon Evaluation to Committed FormAndrew M. Pitts, Joshua R. X. Ross. 18-33
- A Process Algebra with Distributed PrioritiesRance Cleaveland, Gerald Lüttgen, V. Natarajan. 34-49
- Symbolic Transition Graph with AssignmentHuimin Lin. 50-65
- Models for Concurrent Constraint ProgrammingVineet Gupta, Radha Jagadeesan, Vijay A. Saraswat. 66-83
- Comparing Transition Systems with Independence and Asynchronous Transition SystemsThomas T. Hildebrandt, Vladimiro Sassone. 84-97
- A Presheaf Semantics of Value-Passing ProcessesGlynn Winskel. 98-114
- Elementary Control StructuresJohn Power. 115-130
- On Transformations of Concurrent Object ProgramsAnna Philippou, David Walker. 131-146
- On Bisimulations for the Asynchronous pi-CalculusRoberto M. Amadio, Ilaria Castellani, Davide Sangiorgi. 147-162
- On the Expressiveness of Internal Mobility in Name-Passing CalculiMichele Boreale. 163-178
- Decoding Choice EncodingsUwe Nestmann, Benjamin C. Pierce. 179-194
- Infinite ResultsFaron Moller. 195-216
- Decidability of Bisimulation Equivalence for Normed Pushdown ProcessesColin Stirling. 217-232
- The Modal mu-calculus Alternation Hierarchy is StrictJulian C. Bradfield. 233-246
- Bisimulation Collapse and the Process TaxonomyOlaf Burkart, Didier Caucal, Bernhard Steffen. 247-262
- On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order LogicDavid Janin, Igor Walukiewicz. 263-277
- A Facile TutorialBent Thomsen, Lone Leth, Tsung-Min Kuo. 278-298
- Testing Probabilistic AutomataRoberto Segala. 299-314
- Extended Markovian Process AlgebraMarco Bernardo, Roberto Gorrieri. 315-330
- Rewriting Logic as a Semantic Framework for Concurrency: a Progress ReportJosé Meseguer. 331-372
- Truly Concurrent Constraint ProgrammingVineet Gupta, Radha Jagadeesan, Vijay A. Saraswat. 373-388
- Constraints as ProcessesBjörn Victor, Joachim Parrow. 389-405
- A Calculus of Mobile AgentsCédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, Didier Rémy. 406-421
- Algebraic Interpretation of Lambda Calculus with ResourcesCarolina Lavatelli. 422-437
- Concurrent Graph and Term Graph RewritingAndrea Corradini. 438-464
- Petri Boxes and Finite PrecedenceRaymond R. Devillers. 465-480
- Constrained Properties, Semilinear Systems, and Petri NetsAhmed Bouajjani, Peter Habermehl. 481-497
- Linear Constraint Systems as High-Level NetsEike Best, Catuscia Palamidessi. 498-513
- A Space-Efficient On-the-fly Algorithm for Real-Time Model CheckingThomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi. 514-529
- State Equivalences for Rectangular Hybrid AutomataThomas A. Henzinger, Peter W. Kopke. 530-545
- Verifying Abstractions of Timed SystemsSerdar Tasiran, Rajeev Alur, Robert P. Kurshan, Robert K. Brayton. 546-562
- Towards Automatic Temporal Logic Verification of Value Passing Process Algebra Using Abstract InterpretationAlessandro Fantechi, Stefania Gnesi, Diego Latella. 563-578
- Modelling and Verification of Distributed AlgorithmsWolfgang Reisig. 579-595
- An Algorithmic Approach for Checking Closure Properties of omega-Regular LanguagesDoron Peled, Thomas Wilke, Pierre Wolper. 596-610
- Towards Automata for Branching Time and Partial OrderMichaela Huhn, Peter Niebert. 611-626
- Asynchronous Cellular Automata for Pomsets Without Auto-concurrencyManfred Droste, Paul Gastin. 627-638
- Action Refinement and Property Inheritance in Systems of Sequential AgentsMichaela Huhn. 639-654
- A Calculus for Concurrent ObjectsPaolo Di Blasio, Kathleen Fisher. 655-670
- Refinement in InterworkingsSjouke Mauw, Michel A. Reniers. 671-686
- Equivalences of StatechartsAndrea Maggiolo-Schettini, Adriano Peron, Simone Tini. 687-702
- Modular Verification for Shared-Variable Concurrent ProgramsJürgen Dingel. 703-718
- The Impact of Hardware Models on Shared Memory Consistency ConditionsJerry James, Ambuj K. Singh. 719-734
- Synchronous Development of Asynchonous SystemsClemens Fischer, Wil Janssen. 735-750