Lecture Notes in Computer Science - Reachability Problems
Latest Publications

TOTAL DOCUMENTS

15
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

Published By Springer International Publishing

9783319245362, 9783319245379
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

scholarly journals Reachability in Succinct One-Counter Games

2015 ◽  
pp. 37-49 ◽  
Author(s):  
Paul Hunter

Reducing Bounded Realizability Analysis to Reachability Checking

2015 ◽  
pp. 140-152 ◽  
Author(s):  
Masaya Shimakawa ◽  
Shigeki Hagihara ◽  
Naoki Yonezaki

scholarly journals Over-Approximating Terms Reachable by Context-Sensitive Rewriting

2015 ◽  
pp. 128-139 ◽  
Author(s):  
Nirina Andrianarivelo ◽  
Pierre Réty
Keyword(s):  
Context Sensitive

Synthesis Problems for One-Counter Automata

2015 ◽  
pp. 89-100
Author(s):  
Antonia Lechner

A Topological Method for Finding Invariant Sets of Continuous Systems

2015 ◽  
pp. 63-75 ◽  
Author(s):  
Laurent Fribourg ◽  
Eric Goubault ◽  
Sameh Mohamed ◽  
Marian Mrozek ◽  
Sylvie Putot
Keyword(s):  
Topological Method ◽  
Invariant Sets ◽  
Continuous Systems

scholarly journals Integer-Complete Synthesis for Bounded Parametric Timed Automata

2015 ◽  
pp. 7-19 ◽  
Author(s):  
Étienne André ◽  
Didier Lime ◽  
Olivier H. Roux
Keyword(s):  
Timed Automata ◽  
Complete Synthesis

scholarly journals Irregular Behaviours for Probabilistic Automata

2015 ◽  
pp. 33-36 ◽  
Author(s):  
Nathanaël Fijalkow ◽  
Michał Skrzypczak
Keyword(s):  
Probabilistic Automata
Load More ...
Sign in / Sign up

Export Citation Format

Share Document