CONCUR Program

I0		Tuesday		Wednesday		Thursday		Friday

8:30	Live Registration & Coffee	Live Registration & Coffee	Live Registration & Coffee	Live Registration & Coffee





9:00	Live Word Automata with Limited Nondeterminism Session chair: Patrick Totzke Qiyi Tang CONCUR	CONCUR Session 5 - Vector Addition Systems Session chair: Shaull Almagor Reachability in Fixed-Dimensional Continuous VASSMichal Ajdarów, A. R. Balasubramanian, Łukasz Orlikowski Monadic Presburger Predicates have Robust Population ProtocolsPhilipp Czerner, Javier Esparza, Vincent Fischer, Roland Guttenberg, Julian Pins, Simon Reilich Improving Reachability in Vector Addition Systems through PumpabilityWeijun Chen, Yuxi Fu, Yangluo Zheng	Live Reasoning About Probabilistic Loops, Moment by Moment Session chair: Max Tschaikowski Ezio Bartocci Joint Room A	Live Category Theory for Fast Model Checking Algorithms Session chair: Ana Sokolova Ichiro Hasuo Joint Room A











10:00	Live Coffee Break		Live Coffee Break	Live Coffee Break

10:10		Live Coffee Break



10:30	CONCUR Session 1 - Stochastic Games & MDPs I Session chair: Pedro R. D'Argenio Asymmetrically-Discounted Stochastic GamesSarvin Bahmani, Soumyajit Paul, Sven Schewe, Shadi Tasdighi Kalat, Ashutosh Trivedi Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite AutomataChristel Baier, Sascha Klüppelholz, Timm Spork Positional Determinacy with Colored Vertices: a 1-to-2-Player LiftRaphaël Berthon, Stéphane Le Roux Mean-Payoff-Parity and Lifting Strategies from MDPs to 2-Player Stochastic GamesRichard Mayr, Mohan Sai Teja Dantam	CONCUR Session 6 - Concurrency and Verification Session chair: Jérémy Ledent Prophecy-Based Automated Verification of Message-Passing ProgramsTakashi Nagatomi, Musashi Katsura, Naoki Kobayashi, Yusuke Matsushita, Ken Sakayori An MSO Framework for Weak-Memory Verification and RobustnessGiovanna Kobus Conrado, Andreas Pavlogiannis when Behaviours Have to Happen: An Axiomatic Model of Causality in Behaviour-Oriented ConcurrencyLuke Cheeseman, Elias Castegren, Tobias Wrigstad, Sophia Drossopoulou, Matthew Parkinson On the Encodability of Reversible Process CalculiIvan Lanese, Claudio Antares Mezzina, Iain Phillips, Irek Ulidowski, Shoji Yuen	CONCUR Session 9 - Algebraic Methods Session chair: Lutz Schröder Compositionality in Coalgebraic Trace SemanticsRobin Jourde, Henning Urbat, Sergey Goncharov, Stelios Tsampas, Jonas Forster GKAT with Hoare HypothesesJurriaan Rot, Todd Schmid, Jana Wagemaker Continuous Algebras with HypothesesLukas Mulder, Damien Pous, Jana Wagemaker Coinductive reasoning for parametrized functors and monadsUgo Dal Lago, Zeinab Galal	CONCUR Session 11 - Quantitative Verification Session chair: Jean-François Raskin Monitoring Discounted Sum PropertiesFilip Cano, Thomas A. Henzinger, Konstantin Kueffner, Ege Saraç Completeness for Probabilistic Boolean TapesFilippo Bonchi, Cipriano Junior Cioffo Graded Semantics of Nominal SystemsHannes Schulze, Lutz Schröder, Üsame Cengiz Representing One Letter Weighted Automata Over the Tropical SemiringShaull Almagor, Ismaël Jecker, Filip Mazowiecki, Łukasz Orlikowski, David Purser, Henry Sinclair-Banks

















12:00	Live Lunch	Live Lunch	Live Lunch	Live Lunch

















13:30	CONCUR Session 2 - Stochastic Games & MDPs II Generalized Bidding Games: Where Bidding and Stochastic Games MeetAli Asadi, Thomas A. Henzinger, Ehsan Kafshdar Goharshady, Pavol Kebis, Kaushik Mallik Sure-almost-sure and Sure-limit-sure Window Mean Payoff in Markov Decision ProcessesPranshu Gaba, Shibashis Guha PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional DistanceAli Asadi, Krishnendu Chatterjee, Pavol Kebis	CONCUR Session 7 - Time Reaching as Cheap as Possible in 1-clock Robust Weighted Timed GamesNathalie Bertrand, Maëlle Gautrin, Julie Parreaux Buffered control for opacity in timed automataÉtienne André, Sarah Dépernet, Engel Lefaucheux Positional Properties in Temporal LogicJessica Newman, Benjamin Plummer	CONCUR Session 10 - Parameterised Verification WinPop: Making populations win togetherNathalie Bertrand, Patricia Bouyer, Luc Lapointe, Corto Mascle Parameterized Verification of Asynchronous Round-Based Distributed Algorithms via Reduction to Finite-Counter SystemsNathalie Bertrand, Pranav Ghorpade, Sasha Rubin On parameterized verification over tree topologiesRomain Delpy, Anca Muscholl, Grégoire Sutre	CONCUR Session 12 - Automata and Decompositions Session chair: Anca Muscholl Decomposition of Automata recognizing IdealsMathias Berry, Ismaël Jecker, Pierre-Cyrille Héam A Factorization Theorem for Forest AlgebrasShaull Almagor, Michaël Cadilhac, Asaf Shoham Complementing Emerson-Lei Elevator AutomataOndrej Alexaj, Vojtěch Havlena, Ondřej Lengál, Yong Li, Nicolas Mazzocchi













14:40	Live Coffee Break	Live Coffee Break	Live Coffee Break	Live Coffee Break



15:00	CONCUR Session 3 - Behavioural Metrics Session chair: Henning Urbat Threshold-Based Behavioural DistancesJonas Forster, Lutz Schröder, Paul Wild, Barbara König, Pedro Nora On the Continuity of the Probabilistic Bisimilarity DistanceSyyeda Zainab Fatmi, Stefan Kiefer, David Parker, Franck van Breugel On the Complexity of Robust Markov Decision Processes and Bisimulation MetricsMarnix Suilen, Guillermo Perez	CONCUR Test of Time Session Session chair: Wan Fokkink A New Type System for Deadlock-Free ProcessesNaoki Kobayashi Strategy LogicNir Piterman	Live An Introduction to Multi-Environment Markov Decision Processes Session chair: Patrick Totzke Jean-François Raskin CONCUR	Live On the role of prose in specifications Session chair: Ana Sokolova Jade Alglave CONCUR













16:10	Live Coffee Break	Live Coffee Break		Live Coffee Break



16:30	CONCUR Session 4 - (Bi)Simulations Session chair: Rob van Glabbeek Revisiting True Concurrency Bisimilarities: On the Role of Backward Ready Multisets and Why They Are Not Enough for HPB and HHPBAndrea Esposito, Marco Bernardo Wheeler BisimulationsNicola Cotumaccio Minimal and Canonical Quotients for Simulation EquivalencesEduardo Costa Martins, Tim Willemse	CONCUR Session 8 - Higher Dimensional Automata and Semantics Session chair: Sergey Goncharov Bisimulations and Modal Logics for Higher Dimensional AutomataSafa Zouari, Rob van Glabbeek, Krzysztof Ziemianski Algebraic Characterization of FO-definable Languages of Higher-Dimensional AutomataEnzo Erlich, Jérémy Ledent, Krzysztof Ziemiański Concurrent Visibility: higher-order concurrency with first-order storeIwan Quémerais, Guilhème Jaber, Ken Sakayori, Davide Sangiorgi		CONCUR Session 13 - Partial Observation Active Diagnosis with Costs and RewardsSerge Haddad, Engel Lefaucheux, Stefan Schwoon From Coalgebraic Determinization to Belief Construction for Partial ObservabilityMayuko Kori, Kazuki Watanabe Classification under uncertaintyOfer Leshkowitz, Orna Kupferman

















18:00	Live Reception			Live Football











19:00			Live Boat Tour / Dinner (Boarding at 7:15pm)

Tuesday

8:30	Live Registration & Coffee
9:00	Live Word Automata with Limited Nondeterminism Session chair: Patrick Totzke Qiyi Tang CONCUR
10:00	Live Coffee Break
10:30	CONCUR Session 1 - Stochastic Games & MDPs I Session chair: Pedro R. D'Argenio Asymmetrically-Discounted Stochastic Games Sarvin Bahmani, Soumyajit Paul, Sven Schewe, Shadi Tasdighi Kalat, Ashutosh Trivedi Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata Christel Baier, Sascha Klüppelholz, Timm Spork Positional Determinacy with Colored Vertices: a 1-to-2-Player Lift Raphaël Berthon, Stéphane Le Roux Mean-Payoff-Parity and Lifting Strategies from MDPs to 2-Player Stochastic Games Richard Mayr, Mohan Sai Teja Dantam
12:00	Live Lunch
13:30	CONCUR Session 2 - Stochastic Games & MDPs II Generalized Bidding Games: Where Bidding and Stochastic Games Meet Ali Asadi, Thomas A. Henzinger, Ehsan Kafshdar Goharshady, Pavol Kebis, Kaushik Mallik Sure-almost-sure and Sure-limit-sure Window Mean Payoff in Markov Decision Processes Pranshu Gaba, Shibashis Guha PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance Ali Asadi, Krishnendu Chatterjee, Pavol Kebis
14:40	Live Coffee Break
15:00	CONCUR Session 3 - Behavioural Metrics Session chair: Henning Urbat Threshold-Based Behavioural Distances Jonas Forster, Lutz Schröder, Paul Wild, Barbara König, Pedro Nora On the Continuity of the Probabilistic Bisimilarity Distance Syyeda Zainab Fatmi, Stefan Kiefer, David Parker, Franck van Breugel On the Complexity of Robust Markov Decision Processes and Bisimulation Metrics Marnix Suilen, Guillermo Perez
16:10	Live Coffee Break
16:30	CONCUR Session 4 - (Bi)Simulations Session chair: Rob van Glabbeek Revisiting True Concurrency Bisimilarities: On the Role of Backward Ready Multisets and Why They Are Not Enough for HPB and HHPB Andrea Esposito, Marco Bernardo Wheeler Bisimulations Nicola Cotumaccio Minimal and Canonical Quotients for Simulation Equivalences Eduardo Costa Martins, Tim Willemse
18:00	Live Reception

Wednesday

8:30	Live Registration & Coffee
9:00	CONCUR Session 5 - Vector Addition Systems Session chair: Shaull Almagor Reachability in Fixed-Dimensional Continuous VASS Michal Ajdarów, A. R. Balasubramanian, Łukasz Orlikowski Monadic Presburger Predicates have Robust Population Protocols Philipp Czerner, Javier Esparza, Vincent Fischer, Roland Guttenberg, Julian Pins, Simon Reilich Improving Reachability in Vector Addition Systems through Pumpability Weijun Chen, Yuxi Fu, Yangluo Zheng
10:10	Live Coffee Break
10:30	CONCUR Session 6 - Concurrency and Verification Session chair: Jérémy Ledent Prophecy-Based Automated Verification of Message-Passing Programs Takashi Nagatomi, Musashi Katsura, Naoki Kobayashi, Yusuke Matsushita, Ken Sakayori An MSO Framework for Weak-Memory Verification and Robustness Giovanna Kobus Conrado, Andreas Pavlogiannis when Behaviours Have to Happen: An Axiomatic Model of Causality in Behaviour-Oriented Concurrency Luke Cheeseman, Elias Castegren, Tobias Wrigstad, Sophia Drossopoulou, Matthew Parkinson On the Encodability of Reversible Process Calculi Ivan Lanese, Claudio Antares Mezzina, Iain Phillips, Irek Ulidowski, Shoji Yuen
12:00	Live Lunch
13:30	CONCUR Session 7 - Time Reaching as Cheap as Possible in 1-clock Robust Weighted Timed Games Nathalie Bertrand, Maëlle Gautrin, Julie Parreaux Buffered control for opacity in timed automata Étienne André, Sarah Dépernet, Engel Lefaucheux Positional Properties in Temporal Logic Jessica Newman, Benjamin Plummer
14:40	Live Coffee Break
15:00	CONCUR Test of Time Session Session chair: Wan Fokkink A New Type System for Deadlock-Free Processes Naoki Kobayashi Strategy Logic Nir Piterman
16:10	Live Coffee Break
16:30	CONCUR Session 8 - Higher Dimensional Automata and Semantics Session chair: Sergey Goncharov Bisimulations and Modal Logics for Higher Dimensional Automata Safa Zouari, Rob van Glabbeek, Krzysztof Ziemianski Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata Enzo Erlich, Jérémy Ledent, Krzysztof Ziemiański Concurrent Visibility: higher-order concurrency with first-order store Iwan Quémerais, Guilhème Jaber, Ken Sakayori, Davide Sangiorgi

Thursday

8:30	Live Registration & Coffee
9:00	Live Reasoning About Probabilistic Loops, Moment by Moment Session chair: Max Tschaikowski Ezio Bartocci Joint Room A
10:00	Live Coffee Break
10:30	CONCUR Session 9 - Algebraic Methods Session chair: Lutz Schröder Compositionality in Coalgebraic Trace Semantics Robin Jourde, Henning Urbat, Sergey Goncharov, Stelios Tsampas, Jonas Forster GKAT with Hoare Hypotheses Jurriaan Rot, Todd Schmid, Jana Wagemaker Continuous Algebras with Hypotheses Lukas Mulder, Damien Pous, Jana Wagemaker Coinductive reasoning for parametrized functors and monads Ugo Dal Lago, Zeinab Galal
12:00	Live Lunch
13:30	CONCUR Session 10 - Parameterised Verification WinPop: Making populations win together Nathalie Bertrand, Patricia Bouyer, Luc Lapointe, Corto Mascle Parameterized Verification of Asynchronous Round-Based Distributed Algorithms via Reduction to Finite-Counter Systems Nathalie Bertrand, Pranav Ghorpade, Sasha Rubin On parameterized verification over tree topologies Romain Delpy, Anca Muscholl, Grégoire Sutre
14:40	Live Coffee Break
15:00	Live An Introduction to Multi-Environment Markov Decision Processes Session chair: Patrick Totzke Jean-François Raskin CONCUR
19:00	Live Boat Tour / Dinner (Boarding at 7:15pm)

Friday

8:30	Live Registration & Coffee
9:00	Live Category Theory for Fast Model Checking Algorithms Session chair: Ana Sokolova Ichiro Hasuo Joint Room A
10:00	Live Coffee Break
10:30	CONCUR Session 11 - Quantitative Verification Session chair: Jean-François Raskin Monitoring Discounted Sum Properties Filip Cano, Thomas A. Henzinger, Konstantin Kueffner, Ege Saraç Completeness for Probabilistic Boolean Tapes Filippo Bonchi, Cipriano Junior Cioffo Graded Semantics of Nominal Systems Hannes Schulze, Lutz Schröder, Üsame Cengiz Representing One Letter Weighted Automata Over the Tropical Semiring Shaull Almagor, Ismaël Jecker, Filip Mazowiecki, Łukasz Orlikowski, David Purser, Henry Sinclair-Banks
12:00	Live Lunch
13:30	CONCUR Session 12 - Automata and Decompositions Session chair: Anca Muscholl Decomposition of Automata recognizing Ideals Mathias Berry, Ismaël Jecker, Pierre-Cyrille Héam A Factorization Theorem for Forest Algebras Shaull Almagor, Michaël Cadilhac, Asaf Shoham Complementing Emerson-Lei Elevator Automata Ondrej Alexaj, Vojtěch Havlena, Ondřej Lengál, Yong Li, Nicolas Mazzocchi
14:40	Live Coffee Break
15:00	Live On the role of prose in specifications Session chair: Ana Sokolova Jade Alglave CONCUR
16:10	Live Coffee Break
16:30	CONCUR Session 13 - Partial Observation Active Diagnosis with Costs and Rewards Serge Haddad, Engel Lefaucheux, Stefan Schwoon From Coalgebraic Determinization to Belief Construction for Partial Observability Mayuko Kori, Kazuki Watanabe Classification under uncertainty Ofer Leshkowitz, Orna Kupferman
18:00	Live Football

Caption

Invited

CONCUR