• Bidirectional Nested Weighted Automata Krishnendu Chatterjee Thomas Henzinger Jan Otop
• k-Bounded Petri Net Synthesis from Modal Transition Systems Uli Schlachter Harro Wimmel
• A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic Ki Yung Ahn Ross Horne Alwen Tiu
• Consistently-Detecting Monitors Adrian Francalanza
• Flow Logic Orna Kupferman Gal Vardi
• Rule Formats for Nominal Transition Systems Luca Aceto Ignacio Fábregas Álvaro García-Pérez Anna Ingólfsdóttir Yolanda Ortega-Mallén
• Divergence and unique solution of equations Adrien Durier Daniel Hirschkoff Davide Sangiorgi
• Controlling a Population Nathalie Bertrand Miheer Dewaskar Blaise Genest Hugo Gimbert
• The Robot Routing Problem for Collecting Aggregate Stochastic Rewards Rayna Dimitrova Ivan Gavran Rupak Majumdar Vinayak Prabhu Sadegh Soudjani
• Coverability Synthesis in Parametric Petri Nets Nicolas David Claude Jard Didier Lime Olivier H. Roux
• Divide and Congruence III: Stability & Divergence Wan Fokkink Rob van Glabbeek Bas Luttik
• Checking Linearizability of Concurrent Priority Queues Ahmed Bouajjani Constantin Enea Chao Wang
• Nash Equilibrium and Bisimulation Invariance Julian Gutierrez Paul Harrenstein Giuseppe Perelli Michael Wooldridge
• Goal-Driven Unfolding of Petri Nets Thomas Chatain Loïc Paulevé
• Probabilistic Automata of Bounded Ambiguity Nathanaël Fijalkow Cristian Riveros James Worrell
• Two Lower Bounds for BPA Mingzhang Huang Qiang Yin
• Infinite-Duration Bidding Games Guy Avni Ventsislav Chonev Thomas A. Henzinger
• On the Power of Name-Passing Communication Yuxi Fu
• The Power of Convex Algebras Filippo Bonchi Alexandra Silva Ana Sokolova
• Refinement for signal flow graphs Joshua Holland Pawel Sobocinski Filippo Bonchi Dusko Pavlovic
• Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages Tobias Kappe Paul Brunet Bas Luttik Alexandra Silva Fabio Zanasi
• Algebraic Laws for Weak Consistency Andrea Cerone Alexey Gotsman Hongseok Yang
• Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains Qiyi Tang Franck van Breugel
• On Decidability of Concurrent Kleene Algebra Paul Brunet Damien Pous Georg Struth
• Model-checking Counting Temporal Logics on Flat Structures Normann Decker Peter Habermehl Martin Leucker Arnaud Sangnier Daniel Thoma
• Concurrent Reversible Sessions Ilaria Castellani Mariangiola Dezani-Ciancaglini Paola Giannini
• Unbounded product-form Petri nets Patricia Bouyer Serge Haddad Vincent Jugé
• A Coalgebraic Paige-Tarjan Algorithm Ulrich Dorsch Stefan Milius Lutz Schröder Thorsten Wißmann
• The Complexity of Flat Freeze LTL Benedikt Bollig Karin Quaas Arnaud Sangnier
• Higher-Order Linearisability Andrzej Murawski Nikos Tzevelekos
• Model Checking ω-regular Properties for Quantum Markov Chains Yuan Feng Ernst Moritz Hahn Andrea Turrini Shenggang Ying
• Uniform sampling for networks of automata Nicolas Basset Jean Mairesse Michèle Soria
• Tractability of separation logic with inductive definitions: Beyond lists Taolue Chen Fu Song Zhilin Wu
• Data Multi-Pushdown Automata Parosh Aziz Abdulla C. Aiswarya Mohamed Faouzi Atig
• Towards an Efficient Tree Automata based technique for Timed Systems S. Akshay Paul Gastin Krishna S. Ilias Sarkar
• On Petri Nets with Hierarchical Special Arcs S. Akshay Supratik Chakraborty Ankush Das Vishal Jagannath Sai Sandeep