360 search results - page 2 / 72 » Hybrid Branching-Time Logics |
LOPSTR
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
AUSAI
2009
Springer
14 years 11 days ago
2009
Springer
Model checking games are instances of Hintikka’s game semantics for logic used for purposes of debugging systems verification models. Previous work in the area has developed the...
JOLLI
2002
13 years 5 months ago
2002
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
LOGCOM
2002
13 years 5 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
DLT
2009
13 years 3 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...