- Tight Omega-automata Marek Jankola Thu 06 July 2023
- The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games Thomas Brihaye Véronique Bruyère Aline Goeminne Jean-François Raskin Marie van den Bogaard Mon 26 August 2019
- A Sound Algorithm for Asynchronous Session Subtyping (extended version) Mario Bravetti Marco Carbone Julien Lange Nobuko Yoshida Gianluigi Zavattaro Tue 09 July 2019
- Reachability in Database-driven Systems with Numerical Attributes Under Recency Bounding Parosh Aziz Abdulla C. Aiswarya Mohamed Faouzi Atig Marco Montali Tue 25 June 2019
- Verifying Higher-Order Functions with Tree Automata Thomas Genet Timothée Haudebourg Thomas Jensen Wed 08 May 2019
- Verifying Asynchronous Interactions via Communicating Session Automata Julien Lange Nobuko Yoshida Thu 31 January 2019
- Computational Complexity of Algorithms for Optimization of Multi-Hybrid Renewable Energy Systems F. O. Igbinovia J. Krupka Mon 14 January 2019
- A Type System Describing Unboundedness Pawel Parys Tue 04 December 2018
- The Impatient May Use Limited Optimism to Minimize Regret M. Cadilhac G. A. Pérez M. van den Bogaard Sat 24 November 2018
- Recursion Schemes, the MSO Logic, and the U quantifier P. Parys Sun 14 October 2018
- Multi-weighted Markov Decision Processes with Reachability Objectives P. Bouyer M. González N. Markey M. Randour Sat 15 September 2018
- Verifying Quantitative Temporal Properties of Procedural Programs Mohamed Faouzi Atig Ahmed Bouajjani K. Narayan Kumar Prakash Saivasan Mon 10 September 2018
- Timed context-free temporal logics (extended version) L. Bozzelli A. Murano A. Peron Mon 20 August 2018
- Automata vs Linear-Programming Discounted-Sum Inclusion Suguman Bansal Swarat Chaudhuri Moshe Y. Vardi Thu 26 July 2018
- Separability by Piecewise Testable Languages and Downward Closures Beyond Subwords Georg Zetzsche Sat 14 July 2018
- Progress-preserving Refinements of CTA Massimo Bartoletti Laura Bocchi Maurizio Murgia Sat 07 July 2018
- Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives T. Brihaye V. Bruyère A. Goeminne J.-F. Raskin Tue 19 June 2018
- Analyzing Timed Systems Using Tree Automata S. Akshay Paul Gastin Shankara Narayanan Krishna Tue 15 May 2018
- Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes J. Křetínský T. Meggendorfer Sat 12 May 2018
- Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints J. Kretinsky G. A. Perez J.-F. Raskin Sat 28 April 2018
- Communicating Timed Processes with Perfect Timed Channels P. Aziz Abdulla M. Faouzi Atig S. Krishna Fri 30 March 2018
- A Novel Learning Algorithm for Buchi Automata Based on Family of DFAs and Classification Trees Yong Li Yu-Fang Chen Lijun Zhang Depeng Liu Thu 29 March 2018
- A theoretical framework for cardinality-based feature models: The semantics and computational aspects Aliakbar Safilian Tom Maibaum Zinovy Diskin Thu 15 March 2018
- Recursion Schemes and the WMSO+U Logic Pawel Parys Thu 08 March 2018
- Definable isomorphism problem Khadijeh Keshvardoost Bartek Klin Sławomir Lasota Joanna Ochremiak Szymon Toruńczyk Sat 03 March 2018
- PTL-separability and closures for WQOs on words Georg Zetzsche Tue 27 February 2018
- Unboundedness problems for languages of vector addition systems Wojciech Czerwiński Piotr Hofman Georg Zetzsche Sat 24 February 2018
- The Complexity of the Diagonal Problem for Recursion Schemes Pawel Parys Sat 17 February 2018
- Learning to Complement Buchi Automata Yong Li Andrea Turrini Lijun Zhang Sven Schewe Tue 09 January 2018
- Compositional Asynchronous Timed Refinement Massimo Bartoletti Laura Bocchi Maurizio Murgia Sat 09 December 2017
- Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection Milan Ceska Vojtech Havlena Lukas Holik Ondrej Lengal Tomas Vojnar Mon 30 October 2017
- Verifying Higher-Order Functions with Tree Automata: Extended Version Thomas Genet Timothée Haudebourg Thomas Jensen Tue 24 October 2017
- Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games Véronique Bruyère Emmanuel Filiot Mickael Randour Jean-François Raskin Tue 26 September 2017
- Admissibility in Games with Imperfect Information (Invited Talk) Romain Brenguier Arno Pauly Jean-François Raskin Ocan Sankur Thu 07 September 2017
- Adding Dense-Timed Stack to Integer Reset Timed Automata Devendra Bhave Shibashis Guha Tue 05 September 2017
- What is Decidable about Perfect Timed Channels Parosh Aziz Abdulla Mohamed Faouzi Atig S. Krishna Tue 22 August 2017
- Towards an Efficient Tree Automata based technique for Timed Systems S. Akshay Paul Gastin Shankara Narayanan Krishna Ilias Sarkar Tue 18 July 2017
- Orbit-Finite Sets and Their Algorithms (Invited Talk) Mikolaj Bojanczyk Sat 08 July 2017
- Admissible Strategies in Timed Games Nicolas Basset Jean-François Raskin Ocan Sankur Tue 27 June 2017
- Automated verification of automata communicating via FIFO and bag buffers Lakhdar Akroun Gwen Salaun Mon 26 June 2017
- Computer aided synthesis: a game theoretic approach Véronique Bruyère Sun 11 June 2017
- A cartesian-closed category for higher-order model checking Martin Hofmann Jérémy Ledent Fri 02 June 2017
- Minimization of Symbolic Transducers Olli Saarikivi Margus Veanes Sun 21 May 2017
- Value Iteration for Long-run Average Reward in Markov Decision Processes Pranav Ashok Krishnendu Chatterjee Przemyslaw Daca Jan Křetínský Tobias Meggendorfer Sat 13 May 2017
- Infinite-Duration Bidding Games Guy Avni Ventsislav Chonev Thomas A. Henzinger Fri 12 May 2017
- Domains for Higher-Order Games Matthew Hague Roland Meyer Sebastian Muskalla Sat 06 May 2017
- Computing Quantiles in Markov Chains with Multi-Dimensional Costs Christoph Haase Stefan Kiefer Markus Lohrey Thu 27 April 2017
- On Strong Determinacy of Countable Stochastic Games Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Dominik Wojtczak Sat 22 April 2017
- Forward Bisimulations for Nondeterministic Symbolic Finite Automata Loris D'Antoni Margus Veanes Thu 06 April 2017
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT Matthias Heizmann Christian Schilling Daniel Tischner Thu 06 April 2017
- On the Existence of Weak Subgame Perfect Equilibria Véronique Bruyère Stéphane Le Roux Arno Pauly Jean-François Raskin Sun 26 March 2017
- Synchronizability of Communicating Finite State Machines is not Decidable Alain Finkel Etienne Lozes Tue 28 February 2017
- Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes Raphael Berthon Mickael Randour Jean-François Raskin Mon 27 February 2017
- Regular Separability of Well Structured Transition Systems Wojciech Czerwiński Sławomir Lasota Mon 27 February 2017
- Regular Separability of One Counter Automata Wojciech Czerwiński Sławomir Lasota Thu 19 January 2017
- Liveness Verification and Synthesis: New Algorithms for Recursive Programs Roland Meyer Sebastian Muskalla Elisabeth Neumann Thu 19 January 2017
- On the Upward/Downward Closures of Petri Nets Mohamed Faouzi Atig Roland Meyer Sebastian Muskalla Prakash Saivasan Thu 19 January 2017
- Analyzing Timed Systems Using Tree Automata S. Akshay Paul Gastin Shankara Narayanan Krishna Tue 10 January 2017
- Random Models for Evaluating Efficient Buchi Universality Checking Corey Fisher Seth Fogarty Moshe Vardi Mon 09 January 2017
- LOIS: Syntax and Semantics Eryk Kopczyński Szymon Toruńczyk Tue 27 December 2016
- Automata Theory and Higher-order Model-checking Igor Walukiewicz Thu 22 December 2016
- Reducing Nondeterministic Tree Automata by Adding Transitions Ricardo Manuel de Oliveira Almeida Tue 20 December 2016
- On the existence of weak subgame perfect equilibria Véronique Bruyère Stéphane Le Roux Arno Pauly Jean-François Raskin Sat 10 December 2016
- MEMICS 2016 Workshop N/A Mon 28 November 2016
- Compatibility Properties of Synchronously and Asynchronously Communicating Components Rolf Hennicker Michel Bidoit Sat 19 November 2016
- A Novel Learning Algorithm for Buchi Automata based on Family of DFAs and Classification Trees Yong Li Yu-Fang Chen Lijun Zhang Depeng Liu Tue 01 November 2016
- A Symbolic Decision Procedure for Symbolic Alternating Finite Automata Loris D'Antoni Zachary Kincaid Fang Wang Thu 13 October 2016
- Multi-Buffer Simulations for Trace Language Inclusion Milka Hutagalung Norbert Hundeshagen Dietrich Kuske Martin Lange Etienne Lozes Tue 20 September 2016
- Summaries for Context-Free Games Lukáš Holík Roland Meyer Sebastian Muskalla Tue 13 September 2016
- Synchronizing Data Words for Register Automata Parvaneh Babari Karin Quaas Mahsa Shirmohammadi Thu 25 August 2016
- Automata for Specifying and Orchestrating Service Contracts Davide Basile Pierpaolo Degano Gian-Luigi Ferrari Tue 02 August 2016
- The Complexity of Rational Synthesis Rodica Condurache Emmanuel Filiot Raffaella Gentilini Jean-François Raskin Tue 02 August 2016
- Extending Finite Memory Determinacy to Multiplayer Games Stéphane Le Roux Arno Pauly Sat 16 July 2016
- Optimizing the Expected Mean Payoff in Energy Markov Decision Processes Tomáš Brázdil Antonín Kučera Petr Novotný Sat 09 July 2016
- On Synchronous and Asynchronous Compatibility of Communicating Components Rolf Hennicker Michel Bidoit Thanh-Son Dang Sun 05 June 2016
- Behavioural Foundations of Feature Modeling Aliakbar Safilian Tue 29 March 2016
- Parity Game Reductions S. Cranen J.J.A. Keiren T.A.C. Willemse Sat 26 March 2016
- A Logical Characterization for Dense-time Visibly Pushdown Automata Devendra Bhave Vrunda Dave Shankara Narayanan Krishna Ramchandra Phawade Ashutosh Trivedi Sat 26 December 2015
- Minimization of Symbolic Automata Loris D'Antoni Margus Veanes Thu 01 October 2015
- Towards Succinctness in Mining Scenario-Based Specifications David Lo Shahar Maoz Mon 14 October 2013
Library Size: 13G (80 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
