|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 9 keywords
|
|
|
|
|
Results
Found 249 publication records. Showing 249 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Kim Guldstrand Larsen |
Symbolic and Compositional Reachability for Timed Automata.  |
RP  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Schnoebelen |
Lossy Counter Machines Decidability Cheat Sheet. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fang Wei 0001 |
Efficient Graph Reachability Query Answering Using Tree Decomposition. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Chaloupka |
Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Rabinovich |
Temporal Logics over Linear Time Domains Are in PSPACE. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Sawa |
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Margenstern |
Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Étienne André, Laurent Fribourg |
Behavioral Cartography of Timed Automata. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bell, Vesa Halava, Mika Hirvensalo |
On the Joint Spectral Radius for Bounded Matrix Languages. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera 0001, Igor Potapov (eds.) |
Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth L. McMillan, Lenore D. Zuck |
Abstract Counterexamples for Non-disjunctive Abstractions. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eero Lehtonen |
An Undecidable Permutation of the Natural Numbers. |
RP |
2009 |
DBLP DOI BibTeX RDF |
Permutation, Undecidability |
| 1 | Mohamed Faouzi Atig, Ahmed Bouajjani |
On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine |
Automatic Verification of Directory-Based Consistency Protocols. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mouna Chaouch-Saad, Bernadette Charron-Bost, Stephan Merz |
A Reduction Theorem for the Verification of Round-Based Distributed Algorithms. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Seth |
Games on Higher Order Multi-stack Pushdown Systems. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bournez, Igor Potapov (eds.) |
Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Lugiez |
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Y. Vardi |
Model Checking as A Reachability Problem. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Margenstern |
The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane. |
RP |
2009 |
DBLP DOI BibTeX RDF |
hyperbolic plane, periodic tiling problem, tilings, undecidability |
| 1 | Pieter Collins, Ivan S. Zapreev |
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems. |
RP |
2009 |
DBLP DOI BibTeX RDF |
CTL *, Model Checking, Computability, Dynamic Systems |
| 1 | Oded Maler |
Reachability for Continuous and Hybrid Systems. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko |
How to Tackle Integer Weighted Automata Positivity. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas A. Henzinger, Barbara Jobstmann, Verena Wolf |
Formalisms for Specifying Markovian Population Models. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Peter Habermehl |
On Yen's Path Logic for Petri Nets. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amaldev Manuel, Ramaswamy Ramanujam |
Counting Multiplicity over Infinite Alphabets. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bastien Maubert, Sophie Pinchinat |
Games with Opacity Condition. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | V. S. Anil Kumar 0001, Matthew Macauley, Henning S. Mortveit |
Limit Set Reachability in Asynchronous Graph Dynamical Systems. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Shen |
Algorithmic Information Theory and Foundations of Probability. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Barbuti, Francesca Levi, Paolo Milazzo, Guido Scatena |
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates. |
RP |
2009 |
DBLP DOI BibTeX RDF |
uncertain kinetic rates, interval Markov chains, abstract interpretation, systems biology, probabilistic model checking |
| 1 | Mila E. Majster-Cederbaum, Christoph Minnameier |
Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems. |
RP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Reinhardt |
Reachability in Petri Nets with Inhibitor Arcs. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Marisa Llorens, Javier Oliver 0001, Josep Silva, Salvador Tamarit, Germán Vidal |
Dynamic Slicing Techniques for Petri Nets. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Friso Groote, Bas Ploeger |
Switching Graphs. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Felscher |
The Compositional Method and Regular Reachability. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Margenstern, Yu Song |
A Universal Cellular Automaton on the Ternary Heptagrid. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathaniel Charlton, Michael Huth 0001 |
Falsifying Safety Properties Through Games on Over-approximating Models. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vesa Halava, Igor Potapov |
Preface. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine |
Monotonic Abstraction in Parameterized Verification. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Martin Mundhenk, Michael Thomas 0001, Heribert Vollmer |
The Complexity of Satisfiability for Fragments of CTL and CTL*. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kerstin Bauer, Raffaella Gentilini, Klaus Schneider 0001 |
Approximated Reachability on Hybrid Automata: Falsification meets Certification. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pieter Collins, Alexandre Goldsztejn |
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Martyugin |
The Length of Subset Reachability in Nondeterministic Automata. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Juhani Karhumäki |
Reachability via Cooperating Morphisms. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Étienne André, Thomas Chatain, Laurent Fribourg, Emmanuelle Encrenaz |
An Inverse Method for Parametric Timed Automata. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Praveen, Kamal Lodaya |
Analyzing Reachability for Some Petri Nets With Fast Growing Markings. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai Lampka |
A New Algorithm for Partitioned Symbolic Reachability Analysis. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko |
Handling Left-Quadratic Rules When Completing Tree Automata. |
RP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vesa Halava, Igor Potapov (eds.) |
Proceedings of the Second Workshop on Reachability Problems in Computational Models, RP 2008, Liverpool, UK, September 15-17, 2008 |
RP |
2008 |
DBLP BibTeX RDF |
|
Displaying result #201 - #249 of 249 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license