- In Memory of Oded Maler: Automatic Reachability Analysis of Hybrid-state Automata Martin Franzle Mingshuai Chen Paul Krøger Sat 23 February 2019
- Continuous Reachability for Unordered Data Petri nets is in PTime Utkarsh Gupta Preey Shah S. Akshay Piotr Hofman Sat 23 February 2019
- Model Checking Probabilistic Timed Automata with One or Two Clocks Marcin Jurdziński François Laroussinie Jeremy Sproston Fri 22 February 2019
- Minimum-Time Reachability for Timed Automata Peter Niebert Stavros Tripakis Sergio Yovine Fri 22 February 2019
- Minimum-Cost Reachability for Priced Timed Automata Gerd Behrmann Ansgar Fehnker Thomas Hune Kim Guldstrand Larsen Paul Pettersson Judi Romijn Frits W. Vaandrager Fri 22 February 2019
- Reachability-time Games on Timed Automata Marcin Jurdziński Ashutosh Trivedi Fri 22 February 2019
- Controller Synthesis for Timed Automata Eugene Asarin Oded Maler Amir Pnueli Joseph Sifakis Fri 22 February 2019
- Minimal-Time Synthesis for Parametric Timed Automata Étienne André Vincent Bloemen Laure Petrucci Jaco van de Pol Fri 22 February 2019
- Symbolic Optimal Reachability in Weighted Timed Automata Patricia Bouyer Maximilien Colange Nicolas Markey Wed 13 February 2019
- As Soon As Possible: Time Optimal Control for Timed Automata Eugene Asarin Oded Maler Wed 13 February 2019
- Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets Ernst W. Mayr Jeremias Weihmann Wed 13 February 2019
- BPA bisimilarity is EXPTIME-hard Stefan Kiefer Tue 12 February 2019
- EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets Petr Jančar Petr Osička Zdeněk Sawa Tue 12 February 2019
- Parity games and universal graphs Thomas Colcombet Nathanael Fijalkow Tue 12 February 2019
- Automata and Program Analysis Thomas Colcombet Laure Daviaud Florian Zuleger Tue 12 February 2019
- The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata Yulia Dubov Michael Kaminski Tue 12 February 2019
- mu-calculus on data words Thomas Colcolmbet Amaldev Manuel Tue 12 February 2019
- Who needs category theory Andreas Blass Yuri Gurevich Fri 08 February 2019
- Reduction from Branching-time Property Verification of Higher-order Programs to HFL Validity Checking Keiichi Watanabe Takeshi Tsukada Hiroki Oshikawa Naoki Kobayashi Thu 07 February 2019
- Undecidability of a weak version of MSO+U M. Bojańczyk L. Daviaud B. Guillon V. Penelle A.V. Sreejith Tue 05 February 2019
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
