- A Library for Classical Propositional Logic in Agda Jonathan Prieto-Cubides Camilo Andrés Rodríguez Garzón Andrés Sicard-Ramírez Mon 07 September 2020
- A Henkin-style completeness proof for the modal logic S5 Bruno Bentzen Mon 07 September 2020
- A Lyapunov Approach for Time-Bounded Reachability of CTMCs and CTMDPs Mahmoud Salamati Sadegh Soudjani Rupak Majumdar Fri 04 September 2020
- Bounded Reachability Problems Are Decidable in FIFO Machines Benedikt Bollig Alain Finkel Amrita Suresh Fri 04 September 2020
- Residual Nominal Automata Joshua Moerman Matteo Sammartino Fri 04 September 2020
- Separation and Renaming in Nominal Sets Joshua Moerman Jurriaan Rot Fri 04 September 2020
- Model Learning Frits Vaandrager Fri 04 September 2020
- Automata Tutor v3 Loris D'Antoni Martin Helfrich Jan Kretinsky Emanuel Ramneantu Maximilian Weininger Fri 04 September 2020
- Verification of Message Passing Concurrent Systems Emanuele D'Osualdo Thu 03 September 2020
- Notes on Equivalence and Minimization of Weighted Automata Stefan Kiefer Thu 03 September 2020
- Algebraic Invariants for Linear Hybrid Automata Rupak Majumdar Joel Ouaknine Amaury Pouly James Worrell Thu 03 September 2020
- Tug-of-war and the infinity Laplacian Yuval Peres Oded Schramm Scott Sheffield David B. Wilson Wed 02 September 2020
- A Survey of Bidding Games on Graphs (Invited Paper) Guy Avni Thomas A. Henzinger Wed 02 September 2020
- Comparison of Algorithms for Simple Stochastic Games (Full Version) Jan Kretinsky Emanuel Ramneantu Alexander Slivinskiy Maximilian Weininger Mon 31 August 2020
- Qualitative Multi-Objective Reachability for Ordered Branching MDPs Kousha Etessami Emanuel Martinov Mon 31 August 2020
- Backward Symbolic Optimal Reachability in Weighted Timed Automata Rémi Parrot Didier Lime Mon 31 August 2020
- Taming denumerable Markov decision processes with decisiveness Nathalie Bertrand Patricia Bouyer Thomas Brihaye Paulin Fournier Mon 31 August 2020
- Determinisability of One-Clock Timed Automata Lorenzo Clemente Sławomir Lasota Radosław Piórkowski Thu 27 August 2020
- Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers Mikołaj Bojańczyk Janusz Schmude Sat 22 August 2020
- Universal Trees Grow inside Separating Automata: Quasi-Polynomial Lower Bounds for Parity Games Wojciech Czerwiński Laure Daviaud Nathanael Fijalkow Marcin Jurdziński Ranko Lazić Pawel Parys Wed 19 August 2020
Library Size: 13G (12972 entries),
Last Updated: Apr 16, 2026, 22:09:35,
Build Time: N/A
