Abstract is missing.
- Perspectives on Transactional MemoryMartÃn Abadi, Tim Harris. 1-14 [doi]
- The Effect of Tossing Coins in Omega-AutomataChristel Baier, Nathalie Bertrand, Marcus Größer. 15-29 [doi]
- Bigraphical CategoriesRobin Milner. 30-36 [doi]
- BlenX Static and Dynamic SemanticsCorrado Priami, Paola Quaglia, Alessandro Romanel. 37-52 [doi]
- Flow Policy Awareness for Distributed Mobile CodeAna Almeida Matos. 53-68 [doi]
- Volume and Entropy of Regular Timed Languages: Discretization ApproachEugene Asarin, Aldric Degorre. 69-83 [doi]
- A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and TypesSteffen van Bakel, Maria Grazia Vigliotti. 84-98 [doi]
- Encoding Asynchronous Interactions Using Open Petri NetsPaolo Baldan, Filippo Bonchi, Fabio Gadducci. 99-114 [doi]
- Distributed Asynchronous AutomataNicolas Baudru. 115-130 [doi]
- Algebra for Infinite Forests with an Application to the Temporal Logic EFMikolaj Bojanczyk, Tomasz Idziaszek. 131-145 [doi]
- Deriving Syntax and Axioms for Quantitative Regular BehavioursFilippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva. 146-162 [doi]
- Weighted Bisimulation in Linear Algebraic FormMichele Boreale. 163-177 [doi]
- A Logic-Based Framework for Reasoning about Composite Data StructuresAhmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu. 178-195 [doi]
- Measuring Permissivity in Finite GamesPatricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault. 196-210 [doi]
- Contracts for Mobile ProcessesGiuseppe Castagna, Luca Padovani. 211-228 [doi]
- Power of Randomization in Automata on Infinite StringsRohit Chadha, A. Prasad Sistla, Mahesh Viswanathan. 229-243 [doi]
- Probabilistic Weighted AutomataKrishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger. 244-258 [doi]
- Partially-Commutative Context-Free ProcessesWojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota. 259-273 [doi]
- Testing Finitary Probabilistic ProcessesYuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan. 274-288 [doi]
- A Demonic Approach to Information in Probabilistic SystemsJosée Desharnais, François Laviolette, Amélie Turgeon. 289-304 [doi]
- HYPE: A Process Algebra for Compositional Flows and Emergent BehaviourVashti Galpin, Luca Bortolussi, Jane Hillston. 305-320 [doi]
- Variable Binding, Symmetric Monoidal Closed Theories, and BigraphsRichard H. G. Garner, Tom Hirschowitz, Aurélien Pardon. 321-337 [doi]
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed SchedulersSergio Giro, Pedro R. D Argenio, Luis MarÃa Ferrer Fioriti. 338-353 [doi]
- Model-Checking Games for Fixpoint Logics with Partial Order ModelsJulian Gutierrez, Julian C. Bradfield. 354-368 [doi]
- Reachability in Succinct and Parametric One-Counter AutomataChristoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell. 369-383 [doi]
- Winning Regions of Pushdown Parity Games: A Saturation MethodMatthew Hague, C.-H. Luke Ong. 384-398 [doi]
- Concurrent Kleene AlgebraC. A. R. Hoare, Bernhard Möller, Georg Struth, Ian Wehrman. 399-414 [doi]
- Concavely-Priced Probabilistic Timed AutomataMarcin Jurdzinski, Marta Z. Kwiatkowska, Gethin J. Norman, Ashutosh Trivedi. 415-430 [doi]
- Compositional Control Synthesis for Partially Observable SystemsWouter Kuijper, Jaco van de Pol. 431-447 [doi]
- Howe s Method for Calculi with PassivationSergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani. 448-462 [doi]
- On the Relationship between π-Calculus and Finite Place/Transition Petri NetsRoland Meyer, Roberto Gorrieri. 463-480 [doi]
- Modeling Radio NetworksCalvin C. Newport, Nancy A. Lynch. 481-495 [doi]
- Time-Bounded VerificationJoël Ouaknine, Alexander Rabinovich, James Worrell. 496-510 [doi]
- Secure Enforcement for Global Process SpecificationsJérémy Planul, Ricardo Corin, Cédric Fournet. 511-526 [doi]
- On Convergence of Concurrent Systems under Regular InteractionsPavithra Prabhakar, Sayan Mitra, Mahesh Viswanathan. 527-541 [doi]
- Computing Stuttering SimulationsFrancesco Ranzato, Francesco Tapparo. 542-556 [doi]
- Weak Time Petri Nets Strike Back!Pierre-Alain Reynier, Arnaud Sangnier. 557-571 [doi]
- A General Testability TheoryIsmael RodrÃguez. 572-586 [doi]
- Counterexamples in Probabilistic LTL Model Checking for Markov ChainsMatthias Schmalz, Daniele Varacca, Hagen Völzer. 587-602 [doi]
- Query-Based Model Checking of Ad Hoc Network ProtocolsAnu Singh, C. R. Ramakrishnan, Scott A. Smolka. 603-619 [doi]
- Strict Divergence for Probabilistic Timed AutomataJeremy Sproston. 620-636 [doi]