62 search results - page 5 / 13 » Boolean Abstraction for Temporal Logic Satisfiability |
CSL
2010
Springer
14 years 10 months ago
2010
Springer
d Abstract) Thomas Schwentick and Thomas Zeume TU Dortmund University The finite satisfiability problem for two-variable logic over structures with unary relations and two order re...
EUROGP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
120
Voted
DLT
2009
14 years 7 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...
80
Voted
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— This paper bridges the advances in computer science and control to allow automatic synthesis of control strategies for complex dynamical systems which are guaranteed, by constr...