Abstract is missing.
- Carrying Probabilities to the Infinite WorldParosh Aziz Abdulla. 1-16 [doi]
- Generalized UniversalityEli Gafni, Rachid Guerraoui. 17-27 [doi]
- Causal Nets: A Modeling Language Tailored towards Process DiscoveryWil M. P. van der Aalst, Arya Adriansyah, Boudewijn F. van Dongen. 28-42 [doi]
- On Causal Semantics of Petri NetsRob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke. 43-59 [doi]
- On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic FreezingParitosh K. Pandya, Simoni S. Shah. 60-75 [doi]
- Timed Automata Can Always Be Made ImplementablePatricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane. 76-91 [doi]
- Coarse Abstractions Make Zeno Behaviours Difficult to DetectFrédéric Herbreteau, B. Srivathsan. 92-107 [doi]
- Bisimulations Meet PCTL Equivalences for Probabilistic AutomataLei Song, Lijun Zhang, Jens Chr. Godskesen. 108-123 [doi]
- A Spectrum of Behavioral Relations over LTSs on Probability DistributionsSilvia Crafa, Francesco Ranzato. 124-139 [doi]
- Fixed-Delay Events in Generalized Semi-Markov Processes RevisitedTomás Brázdil, Jan Krcál, Jan Kretínský, Vojtech Rehák. 140-155 [doi]
- Semantic Analysis of Gossip Protocols for Wireless Sensor NetworksRuggero Lanotte, Massimo Merro. 156-170 [doi]
- An Automaton over Data Words That Captures EMSO LogicBenedikt Bollig. 171-186 [doi]
- Advanced Ramsey-Based Büchi Automata Inclusion TestingParosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar. 187-202 [doi]
- Reachability of Multistack Pushdown Systems with Scope-Bounded Matching RelationsSalvatore La Torre, Margherita Napoli. 203-218 [doi]
- Granularity and Concurrent Separation LogicJonathan Hayman. 219-234 [doi]
- Tractable Reasoning in a Fragment of Separation LogicByron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell. 235-249 [doi]
- On Locality and the Exchange Law for Concurrent ProcessesC. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth. 250-264 [doi]
- Typed ψ-calculiHans Hüttel. 265-279 [doi]
- Full Abstraction in a Subtyped pi-Calculus with Linear TypesRomain Demangeon, Kohei Honda. 280-296 [doi]
- Controlling Reversibility in Higher-Order PiIvan Lanese, Claudio Antares Mezzina, Alan Schmitt, Jean-Bernard Stefani. 297-311 [doi]
- A Connector Algebra for P/T Nets InteractionsRoberto Bruni, Hernán C. Melgratti, Ugo Montanari. 312-326 [doi]
- Vector Addition System Reversible Reachability ProblemJérôme Leroux. 327-341 [doi]
- Efficient Contextual UnfoldingCésar Rodríguez, Stefan Schwoon, Paolo Baldan. 342-357 [doi]
- Parameterized Complexity Results for 1-safe Petri NetsM. Praveen, Kamal Lodaya. 358-372 [doi]
- The Decidability of the Reachability Problem for CCS!Chaodong He. 373-388 [doi]
- Static Livelock Analysis in CSPJoël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell. 389-403 [doi]
- Dynamic Reactive ModulesJasmin Fisher, Thomas A. Henzinger, Dejan Nickovic, Nir Piterman, Anmol V. Singh, Moshe Y. Vardi. 404-418 [doi]
- Weak Kripke Structures and LTLLars Kuhtz, Bernd Finkbeiner. 419-433 [doi]
- Efficient CTL Model-Checking for Pushdown SystemsFu Song, Tayssir Touili. 434-449 [doi]
- Reasoning about Threads with Bounded Lock ChainsVineet Kahlon. 450-465 [doi]
- A Temporal Logic for the Interaction of StrategiesFarn Wang, Chung-Hao Huang, Fang Yu. 466-481 [doi]
- The Complexity of Nash Equilibria in Limit-Average GamesMichael Ummels, Dominik Wojtczak. 482-496 [doi]
- Two Variable vs. Linear Temporal Logic in Model Checking and GamesMichael Benedikt, Rastislav Lenhardt, James Worrell. 497-511 [doi]
- A Compositional Framework for Controller SynthesisChristel Baier, Joachim Klein, Sascha Klüppelholz. 512-527 [doi]
- Decidability of Branching Bisimulation on Normed Commutative Context-Free ProcessesWojciech Czerwinski, Piotr Hofman, Slawomir Lasota. 528-542 [doi]
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite SystemsStefan Göller, Anthony Widjaja Lin. 543-558 [doi]