Abstract is missing.
- Channel Representations in Protocol VerificationParosh Aziz Abdulla, Bengt Jonsson. 1-15 [doi]
- Bigraphical Reactive SystemsRobin Milner. 16-35 [doi]
- Control of Networks of Unmanned VehiclesShankar Sastry. 36 [doi]
- Process Algebra and SecuritySteve Schneider. 37-38 [doi]
- Using the Bandera Tool Set to Model-Check Properties of Concurrent Java SoftwareJohn Hatcliff, Matthew B. Dwyer. 39-58 [doi]
- Performance Evaluation : = (Process Algebra + Model Checking) × Markov ChainsHolger Hermanns, Joost-Pieter Katoen. 59-81 [doi]
- Typing Mobility in the Seal CalculusGiuseppe Castagna, Giorgio Ghelli, Francesco Zappa Nardelli. 82-101 [doi]
- Reasoning about Security in Mobile AmbientsMichele Bugliesi, Giuseppe Castagna, Silvia Crafa. 102-120 [doi]
- Synchronized Hyperedge Replacement with Name MobilityDan Hirsch, Ugo Montanari. 121-136 [doi]
- Dynamic Input/Output Automata: A Formal Model for Dynamic SystemsPaul C. Attie, Nancy A. Lynch. 137-151 [doi]
- Probabilistic Information Flow in a Process AlgebraAlessandro Aldini. 152-168 [doi]
- Symbolic Computation of Maximal Probabilistic ReachabilityMarta Z. Kwiatkowska, Gethin J. Norman, Jeremy Sproston. 169-183 [doi]
- Randomized Non-sequential ProcessesHagen Völzer. 184-201 [doi]
- Liveness and Fairness in Process-Algebraic VerificationAntti Puhakka, Antti Valmari. 202-217 [doi]
- Bounded Reachability Checking with Process SemanticsKeijo Heljanko. 218-232 [doi]
- Techniques for Smaller Intermediary BDDsJaco Geldenhuys, Antti Valmari. 233-247 [doi]
- An Algebraic Characterization of Data and Timed LanguagesPatricia Bouyer, Antoine Petit, Denis Thérien. 248-261 [doi]
- A Faster-than Relation for Asynchronous ProcessesGerald Lüttgen, Walter Vogler. 262-276 [doi]
- On the Power of Labels in Transition SystemsJirí Srba. 277-291 [doi]
- On Barbed Equivalences in pi-CalculusDavide Sangiorgi, David Walker. 292-304 [doi]
- CCS with Priority GuardsIain Phillips. 305-320 [doi]
- A Testing Theory for Generally Distributed Stochastic ProcessesNatalia López, Manuel Núñez. 321-335 [doi]
- An Algorithm for Quantitative Verification of Probabilistic Transition SystemsFranck van Breugel, James Worrell. 336-350 [doi]
- Compositional Methods for Probabilistic SystemsLuca de Alfaro, Thomas A. Henzinger, Ranjit Jhala. 351-365 [doi]
- Towards an Efficient Algorithm for Unfolding Petri NetsVictor Khomenko, Maciej Koutny. 366-380 [doi]
- A Static Analysis Technique for Graph Transformation SystemsPaolo Baldan, Andrea Corradini, Barbara König. 381-395 [doi]
- Local First Search - A New Paradigm for Partial Order ReductionsPeter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez. 396-410 [doi]
- Extending Memory Consistency of Finite Prefixes to Infinite ComputationsMarcelo Glusman, Shmuel Katz. 411-425 [doi]
- Abstraction-Based Model Checking Using Modal Transition SystemsPatrice Godefroid, Michael Huth, Radha Jagadeesan. 426-440 [doi]
- Efficient Multiple-Valued Model-Checking Using Lattice RepresentationsMarsha Chechik, Benet Devereux, Steve M. Easterbrook, Albert Y. C. Lai, Victor Petrovykh. 441-455 [doi]
- Divide and Compose: SCC Refinement for Language EmptinessChao Wang, Roderick Bloem, Gary D. Hachtel, Kavita Ravi, Fabio Somenzi. 456-471 [doi]
- Unavoidable Configurations of Parameterized Rings of ProcessesMarie Duflot, Laurent Fribourg, Ulf Nilsson. 472-486 [doi]
- Logic of Global SynchronyYifeng Chen, Jeff W. Sanders. 487-501 [doi]
- Compositional Modeling of Reactive Systems Using Open NetsPaolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel. 502-518 [doi]
- Extended Temporal Logic RevisitedOrna Kupferman, Nir Piterman, Moshe Y. Vardi. 519-535 [doi]
- Symbolic Algorithms for Infinite-State GamesLuca de Alfaro, Thomas A. Henzinger, Rupak Majumdar. 536-550 [doi]
- A Game-Based Verification of Non-repudiation and Fair Exchange ProtocolsSteve Kremer, Jean-François Raskin. 551-565 [doi]
- The Control of Synchronous Systems, Part IILuca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang. 566-582 [doi]