default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th RP 2014: Oxford, UK
- Joël Ouaknine, Igor Potapov, James Worrell:
Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings. Lecture Notes in Computer Science 8762, Springer 2014, ISBN 978-3-319-11438-5 - Sylvain Schmitz
:
Complexity Bounds for Ordinal-Based Termination - (Invited Talk). 1-19 - Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly:
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. 20-31 - Paul C. Bell, Shang Chen, Lisa M. Jackson:
Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives. 32-44 - Benedikt Bollig, Paul Gastin, Jana Schubert:
Parameterized Verification of Communicating Automata under Context Bounds. 45-57 - Arnaud Carayol, Matthew Hague:
Regular Strategies in Pushdown Reachability Games. 58-71 - Giorgio Delzanno, Jan Stückrath:
Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations. 72-84 - Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. 85-97 - Gilles Geeraerts, Joël Goossens, Amélie Stainer:
Synthesising Succinct Strategies in Safety and Reachability Games. 98-111 - Christoph Haase, Simon Halfon:
Integer Vector Addition Systems with States. 112-124 - Serge Haddad, Benjamin Monmege:
Reachability in MDPs: Refining Convergence of Value Iteration. 125-137 - Hsi-Ming Ho:
On the Expressiveness of Metric Temporal Logic over Bounded Timed Words. 138-150 - Piotr Hofman, Patrick Totzke:
Trace Inclusion for One-Counter Nets Revisited. 151-162 - Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Mean-Payoff Games with Partial-Observation - (Extended Abstract). 163-175 - Aleksandra Jovanovic, Marta Z. Kwiatkowska:
Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions. 176-189 - Jérôme Leroux, Philippe Schnoebelen:
On Functions Weakly Computable by Petri Nets and Vector Addition Systems. 190-202 - Ahmed Mahdi, Martin Fränzle:
Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems. 203-215 - Ahmed Mahdi, Bernd Westphal, Martin Fränzle:
Transformations for Compositional Verification of Assumption-Commitment Properties. 216-229 - Julian Rathke, Pawel Sobocinski, Owen Stephens:
Compositional Reachability in Petri Nets. 230-243
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.
last updated on 2025-02-15 00:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
