Sciweavers

276 search results - page 6 / 56
» From Model-Checking to Temporal Logic Constraint Solving
Sort
View
86
Voted
VMCAI
2010
Springer
15 years 6 months ago
Improved Model Checking of Hierarchical Systems
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
Benjamin Aminof, Orna Kupferman, Aniello Murano
ECAI
2008
Springer
14 years 11 months ago
Learning in Planning with Temporally Extended Goals and Uncontrollable Events
Recent contributions to advancing planning from the classical model to more realistic problems include using temporal logic such as LTL to express desired properties of a solution ...
André A. Ciré, Adi Botea
98
Voted
ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
15 years 4 months ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange
CAV
2007
Springer
86views Hardware» more  CAV 2007»
15 years 3 months ago
From Liveness to Promptness
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
LPNMR
2001
Springer
15 years 2 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä