Abstract is missing.
- Querying UML Class DiagramsAndrea Calì, Georg Gottlob, Giorgio Orsi, Andreas Pieris. 1-25 [doi]
- Bicategories of Concurrent Games - (Invited Paper)Glynn Winskel. 26-41 [doi]
- Fibrational Induction Meets EffectsRobert Atkey, Neil Ghani, Bart Jacobs, Patricia Johann. 42-57 [doi]
- A Coalgebraic Perspective on Minimization and DeterminizationJirí Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius, Alexandra Silva. 58-73 [doi]
- When Is a Container a Comonad?Danel Ahman, James Chapman, Tarmo Uustalu. 74-88 [doi]
- Well-Pointed Coalgebras (Extended Abstract)Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa. 89-103 [doi]
- Combining Interactive and Automatic Reasoning in First Order Theories of Functional ProgramsAna Bove, Peter Dybjer, Andrés Sicard-Ramírez. 104-118 [doi]
- Applicative Bisimulations for Delimited-Control OperatorsDariusz Biernacki, Sergueï Lenglet. 119-134 [doi]
- Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic AutomataSebastian Preugschat, Thomas Wilke. 135-149 [doi]
- Improved Ramsey-Based Büchi ComplementationStefan Breuers, Christof Löding, Jörg Olschewski. 150-164 [doi]
- Extending ${\cal H}_1$ -Clauses with Path DisequalitiesHelmut Seidl, Andreas Reuß. 165-179 [doi]
- Brookes Is Relaxed, Almost!Radha Jagadeesan, Gustavo Petri, James Riely. 180-194 [doi]
- Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic ProcessesMarco Bernardo, Rocco De Nicola, Michele Loreti. 195-209 [doi]
- Is It a "Good" Encoding of Mixed Choice?Kirstin Peters, Uwe Nestmann. 210-224 [doi]
- Event Structure Semantics of Parallel Extrusion in the Pi-CalculusSilvia Crafa, Daniele Varacca, Nobuko Yoshida. 225-239 [doi]
- Narcissists Are Easy, Stepmothers Are HardDaniel Gorín, Lutz Schröder. 240-254 [doi]
- On Nominal Regular Languages with BindersAlexander Kurz, Tomoyuki Suzuki 0001, Emilio Tuosto. 255-269 [doi]
- Robustness of Structurally Equivalent Concurrent Parity GamesKrishnendu Chatterjee. 270-285 [doi]
- Subgame Perfection for Equilibria in Quantitative Reachability GamesThomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert. 286-300 [doi]
- Concurrent Games with Ordered ObjectivesPatricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels. 301-315 [doi]
- Full Abstraction for Set-Based Models of the Symmetric Interaction CombinatorsDamiano Mazza, Neil J. Ross. 316-330 [doi]
- On Distributability of Petri Nets - (Extended Abstract)Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann. 331-345 [doi]
- Functions as Session-Typed ProcessesBernardo Toninho, Luís Caires, Frank Pfenning. 346-360 [doi]
- Deriving Bisimulation Congruences for Conditional Reactive SystemsMathias Hülsbusch, Barbara König. 361-375 [doi]
- First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating TimeAlexander Kartzow. 376-390 [doi]
- Model Checking Languages of Data WordsBenedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar. 391-405 [doi]
- Branching-Time Model Checking of Parametric One-Counter AutomataStefan Göller, Christoph Haase, Joël Ouaknine, James Worrell. 406-420 [doi]
- Synthesizing Probabilistic ComposersSumit Nain, Moshe Y. Vardi. 421-436 [doi]
- On the Complexity of Computing Probabilistic BisimilarityDi Chen, Franck van Breugel, James Worrell. 437-451 [doi]
- Probabilistic Transition System Specification: Congruence and Full Abstraction of BisimulationPedro R. D'Argenio, Matias David Lee. 452-466 [doi]
- On the Complexity of the Equivalence Problem for Probabilistic AutomataStefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell. 467-481 [doi]