Lecture Notes in Computer Science - Reachability Problems
Latest Publications

TOTAL DOCUMENTS

13

(FIVE YEARS 0)

H-INDEX

2

(FIVE YEARS 0)

Published By Springer International Publishing

9783319670881, 9783319670898

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Probabilistic Timed Automata with Clock-Dependent Probabilities

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-67089-8_11 ◽

2017 ◽

pp. 144-159 ◽

Author(s):

Jeremy Sproston

Keyword(s):

Timed Automata ◽

Probabilistic Timed Automata

Download Full-text

Stubborn Sets with Frozen Actions

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-67089-8_12 ◽

2017 ◽

pp. 160-175 ◽

Author(s):

Antti Valmari

Download Full-text

Adding Dense-Timed Stack to Integer Reset Timed Automata

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-67089-8_2 ◽

2017 ◽

pp. 9-25

Author(s):

Devendra Bhave ◽

Shibashis Guha

Keyword(s):

Download Full-text

Distributed Control Synthesis Using Euler’s Method

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-67089-8_9 ◽

2017 ◽

pp. 118-131 ◽

Author(s):

A. Le Coënt ◽

J. Alexandre dit Sandretto ◽

A. Chapoutot ◽

L. Fribourg ◽

F. De Vuyst ◽

...

Keyword(s):

Distributed Control ◽

Control Synthesis ◽

Euler’S Method

Download Full-text

Topological Characterisation of Multi-buffer Simulation

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-67089-8_8 ◽

2017 ◽

pp. 101-117

Author(s):

Milka Hutagalung

Download Full-text

Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-67089-8_13 ◽

2017 ◽

pp. 176-191 ◽

Author(s):

Tomoyuki Yamakami

Keyword(s):

Linear Space ◽

Polynomial Time ◽

Graph Connectivity

Download Full-text

Reachability Problem for Polynomial Iteration Is PSPACE-complete

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-67089-8_10 ◽

2017 ◽

pp. 132-143 ◽

Author(s):

Reino Niskanen

Keyword(s):

Reachability Problem

Download Full-text

Model Checking CTL over Restricted Classes of Automatic Structures

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-67089-8_7 ◽

2017 ◽

pp. 87-100

Author(s):

Norbert Hundeshagen ◽

Martin Lange

Keyword(s):

Model Checking ◽

Automatic Structures

Download Full-text

Refinement of Trace Abstraction for Real-Time Programs

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-67089-8_4 ◽

2017 ◽

pp. 42-58 ◽

Author(s):

Franck Cassez ◽

Peter Gjøl Jensen ◽

Kim Guldstrand Larsen

Keyword(s):

Download Full-text

Copyful Streaming String Transducers

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-67089-8_6 ◽

2017 ◽

pp. 75-86 ◽

Author(s):

Emmanuel Filiot ◽

Pierre-Alain Reynier

Download Full-text