Sciweavers

4 search results - page 1 / 1
» PLTL Partitioned Model Checking for Reactive Systems under F...
Sort
View
CORR
2006
Springer
84views Education» more  CORR 2006»
13 years 4 months ago
PLTL Partitioned Model Checking for Reactive Systems under Fairness Assumptions
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...
Samir Chouali, Jacques Julliand, Pierre-Alain Mass...
LICS
2006
IEEE
13 years 10 months ago
Temporal Logics and Model Checking for Fairly Correct Systems
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
Daniele Varacca, Hagen Völzer
ESEC
1999
Springer
13 years 9 months ago
Checking Progress with Action Priority: Is it Fair?
The liveness characteristics of a system are intimately related to the notion of fairness. However, the task of explicitly modelling fairness constraints is complicated in practice...
Dimitra Giannakopoulou, Jeff Magee, Jeff Kramer
POPL
2005
ACM
14 years 5 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko