Lecture Notes in Computer Science - Reachability Problems
Latest Publications

TOTAL DOCUMENTS

18

(FIVE YEARS 0)

H-INDEX

3

(FIVE YEARS 0)

Published By Springer International Publishing

9783319114385, 9783319114392

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-11439-2_14 ◽

2014 ◽

pp. 176-189 ◽

Author(s):

Aleksandra Jovanović ◽

Marta Kwiatkowska

Keyword(s):

Timed Automata ◽

Stochastic Game ◽

Parameter Synthesis ◽

Probabilistic Timed Automata

Download Full-text

Trace Inclusion for One-Counter Nets Revisited

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-11439-2_12 ◽

2014 ◽

pp. 151-162 ◽

Author(s):

Piotr Hofman ◽

Patrick Totzke

Download Full-text

Synthesising Succinct Strategies in Safety and Reachability Games

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-11439-2_8 ◽

2014 ◽

pp. 98-111 ◽

Author(s):

Gilles Geeraerts ◽

Joël Goossens ◽

Amélie Stainer

Download Full-text

Regular Strategies in Pushdown Reachability Games

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-11439-2_5 ◽

2014 ◽

pp. 58-71 ◽

Author(s):

A. Carayol ◽

M. Hague

Download Full-text

Compositional Reachability in Petri Nets

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-11439-2_18 ◽

2014 ◽

pp. 230-243 ◽

Author(s):

Julian Rathke ◽

Paweł Sobociński ◽

Owen Stephens

Keyword(s):

Download Full-text

On Functions Weakly Computable by Petri Nets and Vector Addition Systems

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-11439-2_15 ◽

2014 ◽

pp. 190-202 ◽

Author(s):

J. Leroux ◽

Ph. Schnoebelen

Keyword(s):

Vector Addition

Download Full-text

On the Expressiveness of Metric Temporal Logic over Bounded Timed Words

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-11439-2_11 ◽

2014 ◽

pp. 138-150 ◽

Author(s):

Hsi-Ming Ho

Keyword(s):

Temporal Logic ◽

Metric Temporal Logic

Download Full-text

Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-11439-2_6 ◽

2014 ◽

pp. 72-84 ◽

Author(s):

Giorgio Delzanno ◽

Jan Stückrath

Keyword(s):

Graph Transformation ◽

Parameterized Verification ◽

Transformation Systems ◽

Graph Transformation Systems

Download Full-text

Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-11439-2_7 ◽

2014 ◽

pp. 85-97 ◽

Author(s):

Stéphane Demri ◽

Amit Kumar Dhar ◽

Arnaud Sangnier

Keyword(s):

Model Checking ◽

Presburger Arithmetic

Download Full-text

Mean-Payoff Games with Partial-Observation

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-11439-2_13 ◽

2014 ◽

pp. 163-175 ◽

Author(s):

Paul Hunter ◽

Guillermo A. Pérez ◽

Jean-François Raskin

Keyword(s):

Partial Observation ◽

Mean Payoff Games ◽

Download Full-text