default search action
10th RP 2016: Aalborg, Denmark
- Kim Guldstrand Larsen, Igor Potapov, Jirí Srba:
Reachability Problems - 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings. Lecture Notes in Computer Science 9899, Springer 2016, ISBN 978-3-319-45993-6 - Alain Finkel:
The Ideal Theory for WSTS. 1-22 - Axel Legay, Sean Sedwards, Louis-Marie Traonouez:
Rare Events for Statistical Model Checking an Overview. 23-35 - Natasha Alechina, Nils Bulling, Stéphane Demri, Brian Logan:
On the Complexity of Resource-Bounded Logics. 36-50 - Eike Best, Harro Wimmel:
Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. 51-62 - Giorgio Delzanno:
Reachability Predicates for Graph Assertions. 63-76 - Thomas Geffroy, Jérôme Leroux, Grégoire Sutre:
Occam's Razor Applied to the Petri Net Coverability Problem. 77-89 - Henri Hansen, Antti Valmari:
Safety Property-Driven Stubborn Sets. 90-103 - Sam A. M. Jones, Richard M. Thomas:
Characterizing Word Problems of Groups. 104-118 - Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst, Ludovic Chamoin:
Distributed Synthesis of State-Dependent Switching Control. 119-133 - Adrien Le Coënt, Laurent Fribourg, Romain Soulat:
Compositional Analysis of Boolean Networks Using Local Fixed-Point Iterations. 134-147 - Matthew Hague, Anthony Widjaja Lin:
Decidable Models of Integer-Manipulating Programs with Recursive Parallelism. 148-162 - Reino Niskanen:
Robot Games with States in Dimension One. 163-176 - Igor Potapov, Olena Prianychnykova, Sergey Verlan:
Insertion-Deletion Systems over Relational Words. 177-191
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.