Lecture Notes in Computer Science - Reachability Problems
Latest Publications

TOTAL DOCUMENTS

19

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642410352, 9783642410369

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Branching-Time Model Checking Gap-Order Constraint Systems

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-41036-9_16 ◽

2013 ◽

pp. 171-182

Author(s):

Richard Mayr ◽

Patrick Totzke

Keyword(s):

Model Checking ◽

Branching Time ◽

Constraint Systems ◽

Order Constraint

Download Full-text

Stability Controllers for Sampled Switched Systems

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-41036-9_13 ◽

2013 ◽

pp. 135-145 ◽

Author(s):

Laurent Fribourg ◽

Romain Soulat

Keyword(s):

Switched Systems

Download Full-text

Provenance Verification

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-41036-9_3 ◽

2013 ◽

pp. 21-22 ◽

Author(s):

Rupak Majumdar ◽

Roland Meyer ◽

Zilong Wang

Download Full-text

Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-41036-9_12 ◽

2013 ◽

pp. 122-134

Author(s):

Søren Kristoffer Stiil Frederiksen ◽

Peter Bro Miltersen

Keyword(s):

Stochastic Games ◽

Concurrent Reachability Games

Download Full-text

Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-41036-9_19 ◽

2013 ◽

pp. 209-221 ◽

Author(s):

Ernst W. Mayr ◽

Jeremias Weihmann

Keyword(s):

Download Full-text

The Dynamic Complexity of the Reachability Problem on Graphs

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-41036-9_5 ◽

2013 ◽

pp. 45-45

Author(s):

Thomas Schwentick

Keyword(s):

Reachability Problem ◽

Dynamic Complexity

Download Full-text

Robustness in Timed Automata

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-41036-9_1 ◽

2013 ◽

pp. 1-18 ◽

Author(s):

Patricia Bouyer ◽

Nicolas Markey ◽

Ocan Sankur

Keyword(s):

Download Full-text

Reachability Problems for Hierarchical Piecewise Constant Derivative Systems

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-41036-9_6 ◽

2013 ◽

pp. 46-58 ◽

Author(s):

Paul C. Bell ◽

Shang Chen

Keyword(s):

Piecewise Constant

Download Full-text

Deciding Continuous-Time Metric Temporal Logic with Counting Modalities

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-41036-9_8 ◽

2013 ◽

pp. 70-82 ◽

Author(s):

Marcello M. Bersani ◽

Matteo Rossi ◽

Pierluigi San Pietro

Keyword(s):

Temporal Logic ◽

Continuous Time ◽

Metric Temporal Logic

Download Full-text

Automated Verification of Concurrent Software

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-41036-9_2 ◽

2013 ◽

pp. 19-20 ◽

Author(s):

Daniel Kroening

Keyword(s):

Automated Verification ◽

Concurrent Software

Download Full-text