Lecture Notes in Computer Science - Reachability Problems
Latest Publications

TOTAL DOCUMENTS

13

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642153488, 9783642153495

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Efficient Graph Reachability Query Answering Using Tree Decomposition

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-15349-5_13 ◽

2010 ◽

pp. 183-197 ◽

Author(s):

Fang Wei

Keyword(s):

Query Answering ◽

Tree Decomposition ◽

Graph Reachability ◽

Reachability Query

Download Full-text

Behavioral Cartography of Timed Automata

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-15349-5_5 ◽

2010 ◽

pp. 76-90 ◽

Author(s):

Étienne André ◽

Laurent Fribourg

Keyword(s):

Download Full-text

Symbolic and Compositional Reachability for Timed Automata

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-15349-5_2 ◽

2010 ◽

pp. 24-28

Author(s):

Kim Guldstrand Larsen

Keyword(s):

Download Full-text

Depth Boundedness in Multiset Rewriting Systems with Name Binding

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-15349-5_11 ◽

2010 ◽

pp. 161-175 ◽

Author(s):

Fernando Rosa-Velardo

Keyword(s):

Rewriting Systems ◽

Download Full-text

Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-15349-5_1 ◽

2010 ◽

pp. 1-23 ◽

Author(s):

Markus Holzer ◽

Martin Kutrib

Keyword(s):

Finite State Machines ◽

State Machines ◽

Descriptional Complexity ◽

Finite State ◽

Pushdown Automata

Download Full-text

Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-15349-5_7 ◽

2010 ◽

pp. 104-119 ◽

Author(s):

Jakub Chaloupka

Keyword(s):

Dimensional Vector ◽

Reachability Problem ◽

Vector Addition

Download Full-text

The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-15349-5_10 ◽

2010 ◽

pp. 146-160 ◽

Author(s):

Martin Mundhenk ◽

Felix Weiß

Keyword(s):

Model Checking ◽

Intuitionistic Logics

Download Full-text

Rewriting Systems for Reachability in Vector Addition Systems with Pairs

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-15349-5_9 ◽

2010 ◽

pp. 133-145

Author(s):

Paulin Jacobé de Naurois ◽

Virgile Mogbil

Keyword(s):

Rewriting Systems ◽

Vector Addition

Download Full-text

Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-15349-5_8 ◽

2010 ◽

pp. 120-132 ◽

Author(s):

Maurice Margenstern

Keyword(s):

Cellular Automata

Download Full-text

On the Joint Spectral Radius for Bounded Matrix Languages

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-642-15349-5_6 ◽

2010 ◽

pp. 91-103

Author(s):

Paul C. Bell ◽

Vesa Halava ◽

Mika Hirvensalo

Keyword(s):

Spectral Radius ◽

Joint Spectral Radius

Download Full-text