Abstract is missing.
- Equivalences of Pushdown Systems Are HardPetr Jancar. 1-28 [doi]
- Active Diagnosis for Probabilistic SystemsNathalie Bertrand, Eric Fabre, Stefan Haar, Serge Haddad, Loïc Hélouët. 29-42 [doi]
- Analysis of Probabilistic Basic Parallel ProcessesRémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin. 43-57 [doi]
- Limit Synchronization in Markov Decision ProcessesLaurent Doyen 0001, Thierry Massart, Mahsa Shirmohammadi. 58-72 [doi]
- Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision ProcessesHongfei Fu. 73-87 [doi]
- Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive TypesLuca Padovani. 88-102 [doi]
- A Semantical and Operational Account of Call-by-Value SolvabilityAlberto Carraro, Giulio Guerrieri. 103-118 [doi]
- Network-Formation Games with Regular ObjectivesGuy Avni, Orna Kupferman, Tami Tamir. 119-133 [doi]
- Playing with Probabilities in Reconfigurable Broadcast NetworksNathalie Bertrand, Paulin Fournier, Arnaud Sangnier. 134-148 [doi]
- Unsafe Order-2 Tree Languages Are Context-SensitiveNaoki Kobayashi 0001, Kazuhiro Inaba, Takeshi Tsukada. 149-163 [doi]
- Game Semantics for Nominal ExceptionsAndrzej S. Murawski, Nikos Tzevelekos. 164-179 [doi]
- Complexity of Model-Checking Call-by-Value ProgramsTakeshi Tsukada, Naoki Kobayashi 0001. 180-194 [doi]
- Resource Reachability Games on Pushdown GraphsMartin Lang. 195-209 [doi]
- Perfect-Information Stochastic Mean-Payoff Parity GamesKrishnendu Chatterjee, Laurent Doyen 0001, Hugo Gimbert, Youssouf Oualhadj. 210-225 [doi]
- Latticed-LTL Synthesis in the Presence of Noisy InputsShaull Almagor, Orna Kupferman. 226-241 [doi]
- The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory StrategiesKrishnendu Chatterjee, Laurent Doyen 0001, Sumit Nain, Moshe Y. Vardi. 242-257 [doi]
- On Negotiation as Concurrency Primitive II: Deterministic Cyclic NegotiationsJavier Esparza, Jörg Desel. 258-273 [doi]
- On Asymmetric Unification and the Combination Problem in Disjoint TheoriesSerdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen. 274-288 [doi]
- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS RulesPedro R. D'Argenio, Daniel Gebler, Matias David Lee. 289-303 [doi]
- Generalized Synchronization TreesJames Ferlez, Rance Cleaveland, Steve Marcus. 304-319 [doi]
- Bisimulations for Communicating Transactions - (Extended Abstract)Vasileios Koutavas, Carlo Spaccasassi, Matthew Hennessy. 320-334 [doi]
- Upper-Expectation Bisimilarity and Łukasiewicz μ-CalculusMatteo Mio. 335-350 [doi]
- Interacting Bialgebras Are FrobeniusFilippo Bonchi, Pawel Sobocinski, Fabio Zanasi. 351-365 [doi]
- Generalized Eilenberg Theorem I: Local Varieties of LanguagesJirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat. 366-380 [doi]
- Combining Bialgebraic Semantics and EquationsJurriaan Rot, Marcello M. Bonsangue. 381-395 [doi]
- Models of a Non-associative CompositionGuillaume Munch-Maccagnoni. 396-410 [doi]
- Foundations for Decision Problems in Separation Logic with General Inductive PredicatesTimos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max I. Kanovich, Joël Ouaknine. 411-425 [doi]
- A Coalgebraic Approach to Linear-Time LogicsCorina Cîrstea. 426-440 [doi]
- A Relatively Complete Calculus for Structured Heterogeneous SpecificationsTill Mossakowski, Andrzej Tarlecki. 441-456 [doi]