default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th RP 2011: Genoa, Italy
- Giorgio Delzanno, Igor Potapov:
Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings. Lecture Notes in Computer Science 6945, Springer 2011, ISBN 978-3-642-24287-8 - Krishnendu Chatterjee:
Graph Games with Reachability Objectives - (Invited Talk). 1 - Taolue Chen
, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Observing Continuous-Time MDPs by 1-Clock Timed Automata. 2-25 - Bruno Courcelle:
Automata for Monadic Second-Order Model-Checking. 26-27 - Jean-François Raskin:
Reachability Problems for Hybrid Automata. 28-30 - Étienne André, Romain Soulat:
Synthesis of Timing Parameters Satisfying Safety Properties. 31-44 - Roland Axelsson, Martin Lange:
Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics. 45-57 - Marcello M. Bersani, Achille Frigeri, Matteo Rossi, Pierluigi San Pietro:
Completeness of the Bounded Satisfiability Problem for Constraint LTL. 58-71 - Yohan Boichut, Thi-Bich-Hanh Dao, Valérie Murat:
Characterizing Conclusive Approximations by Logical Formulae. 72-84 - Rémi Bonnet:
Decidability of LTL for Vector Addition Systems with One Zero-Test. 85-95 - Laura Bozzelli, Pierre Ganty:
Complexity Analysis of the Backward Coverability Algorithm for VASS. 96-109 - Alessandro Carioni, Silvio Ghilardi, Silvio Ranise:
Automated Termination in Model Checking Modulo Theories. 110-124 - Parosh Aziz Abdulla, Jonathan Cederberg, Tomás Vojnar:
Monotonic Abstraction for Programs with Multiply-Linked Structures. 125-138 - Xin Chen, Erika Ábrahám, Goran Frehse:
Efficient Bounded Reachability Computation for Rectangular Automata. 139-152 - Christian Eggermont, Gerhard J. Woeginger:
Reachability and Deadlocking Problems in Multi-stage Scheduling. 153-164 - Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Improving Reachability Analysis of Infinite State Systems by Specialization. 165-179 - Vladimir V. Gusev:
Lower Bounds for the Length of Reset Words in Eulerian Automata. 180-190 - Laurent Fribourg, Ulrich Kühne:
Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method. 191-204 - Maurice Margenstern:
A New Weakly Universal Cellular Automaton in the 3D Hyperbolic Space with Two States. 205-217 - Malcolm Mumme, Gianfranco Ciardo:
A Fully Symbolic Bisimulation Algorithm. 218-230 - Nataliya Skrypnyuk, Flemming Nielson:
Reachability for Finite-State Process Algebras Using Static Analysis. 231-244
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 2024-09-19 23:30 CEST 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:
