Abstract is missing.
- Model Checking for Nominal CalculiGian Luigi Ferrari, Ugo Montanari, Emilio Tuosto. 1-24 [doi]
- Mathematical Models of Computational and Combinatorial StructuresMarcelo P. Fiore. 25-46 [doi]
- Congruence for Structural CongruencesMohammad Reza Mousavi, Michel A. Reniers. 47-62 [doi]
- Probabilistic Congruence for Semistochastic Generative ProcessesRuggero Lanotte, Simone Tini. 63-78 [doi]
- Bisimulation on Speed: A Unified ApproachGerald Lüttgen, Walter Vogler. 79-94 [doi]
- Branching Cells as Local States for Event Structures and Nets: Probabilistic ApplicationsSamy Abbes, Albert Benveniste. 95-109 [doi]
- Axiomatizations for Probabilistic Finite-State BehaviorsYuxin Deng, Catuscia Palamidessi. 110-124 [doi]
- Stochastic Transition Systems for Continuous State Spaces and Non-determinismStefano Cattani, Roberto Segala, Marta Z. Kwiatkowska, Gethin J. Norman. 125-139 [doi]
- Model Checking Durational Probabilistic SystemsFrançois Laroussinie, Jeremy Sproston. 140-154 [doi]
- Free-Algebra Models for the ::::pi::::-CalculusIan Stark. 155-169 [doi]
- A Unifying Model of Variables and NamesMarino Miculan, Kidane Yemane. 170-186 [doi]
- A Category of Higher-Dimensional AutomataUlrich Fahrenberg. 187-201 [doi]
- Third-Order Idealized Algol with Iteration Is DecidableAndrzej S. Murawski, Igor Walukiewicz. 202-218 [doi]
- Fault Diagnosis Using Timed AutomataPatricia Bouyer, Fabrice Chevalier, Deepak D Souza. 219-233 [doi]
- Optimal Conditional Reachability for Multi-priced Timed AutomataKim Guldstrand Larsen, Jacob Illum Rasmussen. 234-249 [doi]
- Alternating Timed AutomataSlawomir Lasota, Igor Walukiewicz. 250-265 [doi]
- Full Abstraction for Polymorphic Pi-CalculusAlan Jeffrey, Julian Rathke. 266-281 [doi]
- Foundations of Web TransactionsCosimo Laneve, Gianluigi Zavattaro. 282-298 [doi]
- Bridging Language-Based and Process Calculi SecurityRiccardo Focardi, Sabina Rossi, Andrei Sabelfeld. 299-315 [doi]
- History-Based Access Control with Local PoliciesMassimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari. 316-332 [doi]
- Composition and Decomposition in True-ConcurrencySibylle B. Fröschle. 333-347 [doi]
- Component Refinement and CSC Solving for STG DecompositionMark Schäfer, Walter Vogler. 348-363 [doi]
- The Complexity of Live Sequence ChartsYves Bontemps, Pierre Yves Schobbens. 364-378 [doi]
- A Simpler Proof Theory for Nominal LogicJames Cheney. 379-394 [doi]
- From Separation Logic to First-Order LogicCristiano Calcagno, Philippa Gardner, Matthew Hague. 395-409 [doi]
- Justifying Algorithms for ::::beta::::-::::eta::::-ConversionHealfdene Goguen. 410-424 [doi]
- On Decidability Within the Arithmetic of Addition and DivisibilityMarius Bozga, Radu Iosif. 425-439 [doi]
- Expressivity of Coalgebraic Modal Logic: The Limits and BeyondLutz Schröder. 440-454 [doi]
- Duality for Logics of Transition SystemsMarcello M. Bonsangue, Alexander Kurz. 455-469 [doi]
- Confluence of Right Ground Term Rewriting Systems Is DecidableLukasz Kaiser. 470-489 [doi]
- Safety Is not a Restriction at Level 2 for String LanguagesKlaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong. 490-504 [doi]
- A Computational Model for Multi-variable Differential CalculusAbbas Edalat, André Lieutier, Dirk Pattinson. 505-519 [doi]