Lecture Notes in Computer Science - Reachability Problems
Latest Publications

TOTAL DOCUMENTS

20
(FIVE YEARS 0)

H-INDEX

5
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642242878, 9783642242885
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Fully Symbolic Bisimulation Algorithm

2011 ◽  
pp. 218-230 ◽  
Author(s):  
Malcolm Mumme ◽  
Gianfranco Ciardo

Reachability and Deadlocking Problems in Multi-stage Scheduling

2011 ◽  
pp. 153-164
Author(s):  
Christian E. J. Eggermont ◽  
Gerhard J. Woeginger
Keyword(s):  
Multi Stage

scholarly journals Characterizing Conclusive Approximations by Logical Formulae

2011 ◽  
pp. 72-84 ◽  
Author(s):  
Yohan Boichut ◽  
Thi-Bich-Hanh Dao ◽  
Valérie Murat

Reachability Problems for Hybrid Automata

2011 ◽  
pp. 28-30
Author(s):  
Jean-François Raskin
Keyword(s):  
Hybrid Automata

Completeness of the Bounded Satisfiability Problem for Constraint LTL

2011 ◽  
pp. 58-71 ◽  
Author(s):  
Marcello M. Bersani ◽  
Achille Frigeri ◽  
Matteo Rossi ◽  
Pierluigi San Pietro
Keyword(s):  
Satisfiability Problem

Synthesis of Timing Parameters Satisfying Safety Properties

2011 ◽  
pp. 31-44 ◽  
Author(s):  
Étienne André ◽  
Romain Soulat
Keyword(s):  
Safety Properties

Reachability for Finite-State Process Algebras Using Static Analysis

2011 ◽  
pp. 231-244 ◽  
Author(s):  
Nataliya Skrypnyuk ◽  
Flemming Nielson
Keyword(s):  
Static Analysis ◽  
Process Algebras ◽  
State Process ◽  
Finite State
Load More ...
Sign in / Sign up

Export Citation Format

Share Document