Abstract is missing.
- Refinement and Verification Applied to an In-Flight Data Acquisition UnitWan Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko, Yuri A. Yushtein. 1-23 [doi]
- A Deductive Proof System for CTLAmir Pnueli, Yonit Kesten. 24-40 [doi]
- Event-State Duality: The Enriched CaseVaughan R. Pratt. 41-56 [doi]
- Expressive Power of Temporal LogicsAlexander Moshe Rabinovich. 57-75 [doi]
- Types, or: Where s the Difference Between CCS and pi?Davide Sangiorgi. 76-97 [doi]
- Introduction to Modal and Temporal Mu-Calculi (Abstract)Julian C. Bradfield. 98 [doi]
- Types for Cryptographic ProtocolsAndrew D. Gordon. 99-100 [doi]
- Network Invariants in ActionYonit Kesten, Amir Pnueli, Elad Shahar, Lenore D. Zuck. 101-115 [doi]
- Regular Model Checking Made Simple and EfficientParosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d Orso. 116-130 [doi]
- A Hierarchy of Polynomial-Time Computable Simulations for AutomataKousha Etessami. 131-144 [doi]
- A Decidable Class of Asynchronous Distributed ControllersP. Madhusudan, P. S. Thiagarajan. 145-160 [doi]
- Alphabet-Based Synchronisation is Exponentially CheaperAntti Valmari, Antti Kervinen. 161-176 [doi]
- Safe Realizability of High-Level Message Sequence ChartsMarkus Lohrey. 177-192 [doi]
- Widening the Boundary between Decidable and Undecidable Hybrid SystemsEugene Asarin, Gerardo Schneider. 193-208 [doi]
- A Spatial Logic for Concurrency (Part II)Luís Caires, Luca Cardelli. 209-225 [doi]
- Reducing Model Checking from Multi-valued {/rm CTL}^{/ast} to {/rm CTL}^{/ast}Beata Konikowska, Wojciech Penczek. 226-239 [doi]
- Local Model Checking Games for Fixed Point Logic with ChopMartin Lange. 240-254 [doi]
- A Decidable Fixpoint Logic for Time-OutsMaria Sorea. 255-271 [doi]
- A Calculus of Mobile ResourcesJens Chr. Godskesen, Thomas T. Hildebrandt, Vladimiro Sassone. 272-287 [doi]
- Using Ambients to Control ResourcesDavid Teller, Pascal Zimmer, Daniel Hirschkoff. 288-303 [doi]
- Typing and Subtyping Mobility in Boxed AmbientsMassimo Merro, Vladimiro Sassone. 304-320 [doi]
- Orchestrating Transactions in Join CalculusRoberto Bruni, Cosimo Laneve, Ugo Montanari. 321-337 [doi]
- Simulation for Continuous-Time Markov ChainsChristel Baier, Joost-Pieter Katoen, Holger Hermanns, Boudewijn R. Haverkort. 338-354 [doi]
- Weak Bisimulation is Sound and Complete for PCTL*Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden. 355-370 [doi]
- Decision Algorithms for Probabilistic BisimulationStefano Cattani, Roberto Segala. 371-385 [doi]
- Axiomatizing an Algebra of Step Reactions for Synchronous LanguagesGerald Lüttgen, Michael Mendler. 386-401 [doi]
- Regular Sets of Pomsets with AutoconcurrencyJean Fanchon, Rémi Morin. 402-417 [doi]
- The Fusion MachinePhilippa Gardner, Cosimo Laneve, Lucian Wischik. 418-433 [doi]
- HOPLA-A Higher-Order Process LanguageMikkel Nygaard, Glynn Winskel. 434-448 [doi]
- A First Order Coalgebraic Model of pi-Calculus Early Observational EquivalenceMaria Grazia Buscemi, Ugo Montanari. 449-465 [doi]
- Traces, Pomsets, Fairness and Full Abstraction for Communicating ProcessesStephen D. Brookes. 466-482 [doi]
- A Framework for the Analysis of Security ProtocolsMichele Boreale, Maria Grazia Buscemi. 483-498 [doi]
- On Name Generation and Set-Based Analysis in the Dolev-Yao ModelRoberto M. Amadio, Witold Charatonik. 499-514 [doi]
- On the Decidability of Cryptographic Protocols with Open-Ended Data StructuresRalf Küsters. 515-530 [doi]
- Causality Semantics of Petri Nets with Weighted Inhibitor ArcsH. C. M. Kleijn, Maciej Koutny. 531-546 [doi]
- Refinement-Robust FairnessHagen Völzer. 547-561 [doi]
- Decidability of Strong Bisimilarity for Timed BPPSlawomir Lasota. 562-578 [doi]
- Undecidability of Weak Bisimilarity for Pushdown ProcessesJirí Srba. 579-593 [doi]
- Why Is Simulation Harder than Bisimulation?Antonín Kucera, Richard Mayr. 594-610 [doi]