default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th RP 2013: Uppsala, Sweden
- Parosh Aziz Abdulla, Igor Potapov:
Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings. Lecture Notes in Computer Science 8169, Springer 2013, ISBN 978-3-642-41035-2 - Patricia Bouyer, Nicolas Markey
, Ocan Sankur:
Robustness in Timed Automata. 1-18 - Daniel Kroening:
Automated Verification of Concurrent Software. 19-20 - Rupak Majumdar, Roland Meyer, Zilong Wang:
Provenance Verification. 21-22 - Akash Lal, Shaz Qadeer:
Reachability Modulo Theories. 23-44 - Thomas Schwentick:
The Dynamic Complexity of the Reachability Problem on Graphs. 45 - Paul C. Bell, Shang Chen:
Reachability Problems for Hierarchical Piecewise Constant Derivative Systems. 46-58 - Béatrice Bérard, Serge Haddad, Aleksandra Jovanovic, Didier Lime:
Parametric Interrupt Timed Automata. 59-69 - Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
Deciding Continuous-Time Metric Temporal Logic with Counting Modalities. 70-82 - Carlo Bellettini, Matteo Camilli, Lorenzo Capra, Mattia Monga:
MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters. 83-95 - Ilaria De Crescenzo, Salvatore La Torre:
Modular Synthesis with Open Components. 96-108 - Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso:
Parameterized Verification of Broadcast Networks of Register Automata. 109-121 - Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen:
Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games. 122-134 - Laurent Fribourg, Romain Soulat:
Stability Controllers for Sampled Switched Systems. 135-145 - Sam A. M. Jones, Richard M. Thomas:
Formal Languages, Word Problems of Groups and Decidability. 146-158 - Kais Klai, Naim Aber, Laure Petrucci:
Verification of Reachability Properties for Time Petri Nets. 159-170 - Richard Mayr, Patrick Totzke:
Branching-Time Model Checking Gap-Order Constraint Systems. 171-182 - Artturi Piipponen, Antti Valmari:
Constructing Minimal Coverability Sets. 183-195 - Julien Reichert:
On the Complexity of Counter Reachability Games. 196-208 - Ernst W. Mayr, Jeremias Weihmann:
Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities. 209-221
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-12-02 21:37 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:
