Sciweavers

187 search results - page 10 / 38
» On Expressive and Model Checking Power of Propositional Prog...
Sort
View
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
13 years 9 months ago
Computation Tree Regular Logic for Genetic Regulatory Networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, H...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
SYNTHESE
2008
99views more  SYNTHESE 2008»
13 years 7 months ago
Public and private communication are different: results on relative expressivity
Dynamic Epistemic Logic (DEL) is the study of how to reason about knowledge, belief, and communication. This paper studies the relative expressivity of certain fragments of the DE...
Bryan Renne
CONCUR
2009
Springer
14 years 2 months ago
Model-Checking Games for Fixpoint Logics with Partial Order Models
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
Julian Gutierrez, Julian C. Bradfield
DLOG
2006
13 years 9 months ago
Model checking the basic modalities of CTL with Description Logic
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...