Sciweavers

713 search results - page 13 / 143
» Model Checking and Transitive-Closure Logic
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
14 years 10 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere
ENTCS
2008
96views more  ENTCS 2008»
14 years 10 months ago
Undecidability of Model Checking in Brane Logic
The Brane Calculus is a calculus intended to model the structure and the dynamics of biological membranes. In order to express properties of systems in this calculus, in previous ...
Giorgio Bacci, Marino Miculan
AUSAI
2009
Springer
15 years 5 months ago
Model Checking Games for a Fair Branching-Time Temporal Epistemic Logic
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...
Xiaowei Huang, Ron van der Meyden
MEMOCODE
2005
IEEE
15 years 4 months ago
Three-valued logic in bounded model checking
In principle, bounded model checking (BMC) leads to semidecision procedures that can be used to verify liveness properties and to falsify safety properties. If the procedures fail...
Tobias Schüle, Klaus Schneider
TABLEAUX
2007
Springer
15 years 4 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...