default search action
Theoretical Computer Science, Volume 735
Volume 735, July 2018
- Joël Ouaknine, Igor Potapov, James Worrell:
Reachability Problems 2014: Special issue. 1 - Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
Equivalence between model-checking flat counter systems and Presburger arithmetic. 2-23 - Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen, Amélie Stainer:
Synthesising succinct strategies in safety games with an application to real-time scheduling. 24-49 - Piotr Hofman, Patrick Totzke:
Trace inclusion for one-counter nets revisited. 50-63 - Aleksandra Jovanovic, Marta Kwiatkowska:
Parameter synthesis for probabilistic timed automata using stochastic game abstractions. 64-81 - Paul Hunter, Arno Pauly, Guillermo A. Pérez, Jean-François Raskin:
Mean-payoff games with partial observation. 82-110 - Serge Haddad, Benjamin Monmege:
Interval iteration algorithm for MDPs and IMDPs. 111-131 - Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly:
On the complexity of bounded time and precision reachability for piecewise affine systems. 132-146 - Dmitry Chistikov, Christoph Haase, Simon Halfon:
Context-free commutative grammars with integer counters and resets. 147-161
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.