Abstract is missing.
- Geometry of Interaction (Abstract)Jean-Yves Girard. 1
- A Compositional Semantics for Statecharts using Labeled Transition SystemsAndrew C. Uselton, Scott A. Smolka. 2-17
- On the Decidability of Non-Interleaving Process EquivalencesAstrid Kiehn. 18-33
- Regularity of BPA-Systems is DecidableSjouke Mauw, Hans Mulder. 34-47
- A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free ProcessesYoram Hirshfeld, Faron Moller. 48-63
- Model-Based Verification Methods and Tools (Abstract)Jean-Claude Fernandez, Joseph Sifakis, Robert de Simone. 64
- New Results on the Analysis of Concurrent Systems with an Infinite Number of ProcessesMahesh Girkar, Robert Moll. 65-80
- Verification of Nonregular Temporal Properties for Context-Free ProcessesAhmed Bouajjani, Rachid Echahed, Riadh Robbana. 81-97
- Pushdown Processes: Parallel Composition and Model CheckingOlaf Burkart, Bernhard Steffen. 98-113
- Local Model Checking for Parallel Compositions of Context-Free ProcessesHardi Hungar. 114-128
- The Logical Structure of Concurrent Constraint Programming Languages (Abstract)Prakash Panangaden. 129
- Countable Non-Determinism and Uncountable LimitsPietro Di Gianantonio, Furio Honsell, Silvia Liani, Gordon D. Plotkin. 130-145
- SProc CategoricallyJ. Robin B. Cockett, David A. Spooner. 146-159
- From Timed Graphs to Hybrid Automata (Abstract)Costas Courcoubetis. 160
- Hierarchical Models of Synchronous Circuits (Abstract)David L. Dill. 161
- The Observational Power of ClocksRajeev Alur, Costas Courcoubetis, Thomas A. Henzinger. 162-177
- A Dynamic Approach to Timed BehaviourJeremy Gunawardena. 178-193
- Algebras of Processes of Timed Petri NetsJózef Winkowski. 194-209
- Operational Semantics for the Petri Box CalculusMaciej Koutny, Javier Esparza, Eike Best. 210-225
- Weak Sequential Composition in Process AlgebrasArend Rensink, Heike Wehrheim. 226-241
- Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent ComputationsParis C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman. 242-266
- On Unifying Assumption-Commitment Style Proof Rules for ConcurrencyQiwen Xu, Antonio Cau, Pierre Collette. 267-282
- Liveness and Fairness in Duration CalculusJens U. Skakkebæk. 283-298
- A Symbolic Semantics for the pi-calculus (Extended Abstract)Michele Boreale, Rocco De Nicola. 299-314
- On Bisimulation in the pi-calculusDavid Walker. 315-330
- Characterizing Bisimulation Congruence in the pi-Calculus (Extended Abstract)Xinxin Liu. 331-350
- The Limit View of Infinite ComputationsNils Klarlund. 351-366
- Trace Refinement of Action SystemsRalph-Johan Back, Joakim von Wright. 367-384
- Bisimulation for Models in ConcurrencyMogens Nielsen, Christian Clausen. 385-400
- Invariants in Process Algebra with DataMarc Bezem, Jan Friso Groote. 401-416
- Testing-Based Abstractions for Value-Passing SystemsRance Cleaveland, James Riely. 417-432
- A Congruence Theorem for Structured Operational Semantics with Predicates and Negative PremisesChris Verhoef. 433-448
- Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular BehavioursLuca Aceto. 449-464
- Process Algebra with Partial ChoiceJos C. M. Baeten, Jan A. Bergstra. 465-480
- Probabilistic Simulations for Probabilistic ProcessesRoberto Segala, Nancy A. Lynch. 481-496
- Fully Abstract Characterizations of Testing Preorders for Probabilistic ProcessesShoji Yuen, Rance Cleaveland, Zeynep Dayar, Scott A. Smolka. 497-512
- Composition and Behaviors of Probabilistic I/O AutomataSue-Hwey Wu, Scott A. Smolka, Eugene W. Stark. 513-528