Results 1  10
of
3,709,738
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 760 (41 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
Observational muCalculus
, 1999
"... We propose an extended modal mucalculus to provide an `assembly language' for modal logics for real time, valuepassing calculi, and other extended models of computation. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We propose an extended modal mucalculus to provide an `assembly language' for modal logics for real time, valuepassing calculi, and other extended models of computation.
Games and Modal MuCalculus
 In Second International Workshop Tools and Algorithms for Construction and Analysis of Systems
, 1996
"... We define EhrenfeuchtFraiss'e games which exactly capture the expressive power of the extremal fixed point operators of modal mucalculus. The resulting games have significance, we believe, within and outside of concurrency theory. On the one hand they naturally extend the iterative bisimul ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
explores the technical contribution that games can make to understanding concurrency. We define EhrenfeuchtFraiss'e games which exactly capture the expressive power of the extremal fixed point operators of modal mucalculus. The resulting games have significance, we believe, within and outside
The Horn Mucalculus
, 1998
"... The Horn calculus is a logic programming language allowing arbitrary nesting of least and greatest fixed points. The Horn programs can naturally expresses safety and liveness properties for reactive systems. We extend the setbased analysis of classical logic programs by mapping arbitrary program ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
The Horn calculus is a logic programming language allowing arbitrary nesting of least and greatest fixed points. The Horn programs can naturally expresses safety and liveness properties for reactive systems. We extend the setbased analysis of classical logic programs by mapping arbitrary
Alternating Epistemic MuCalculus
"... Alternatingtime temporal logic (ATL) is a wellknown logic for reasoning about strategic abilities of agents. An important feature that distinguishes variants of ATL for imperfect information scenarios is that the standard fixed point characterizations of temporal modalities do not hold anymore. In ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
. In this paper, we show that adding explicit fixed point operators to the “nexttime ” fragment of ATL already allows to capture abilities that could not be expressed in ATL. We also illustrate that the new language allows to specify important kinds of abilities, namely ones where the agents can always recompute
On the proof theory of modal mucalculus
 Studia Logica
, 2008
"... We study the prooftheoretic relationship between two deductive systems for the modal mucalculus. First we recall an infinitary system which contains an omega rule allowing to derive the truth of a greatest fixed point from the truth of each of its (infinitely many) approximations. Then we recall a ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We study the prooftheoretic relationship between two deductive systems for the modal mucalculus. First we recall an infinitary system which contains an omega rule allowing to derive the truth of a greatest fixed point from the truth of each of its (infinitely many) approximations. Then we recall
Vacuity Checking in the Modal MuCalculus
 In Proceedings of AMAST’02, volume 2422 of LNCS
, 2002
"... Abstract. Vacuity arises when a logical formula is trivially true in a given model due, for example, to antecedent failure. Beer et al. have recently introduced a logicindependent notion of vacuity and shown that certain logics, i.e., those with polarity, admit an efficient decision procedure for v ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
for vacuity detection. We show that the modal mucalculus, a very expressive temporal logic, is a logic with polarity and hence the results of Beer et al. are applicable. We also extend the definition of vacuity to achieve a new notion of redundancy in logical formulas. Redundancy captures several forms
Sahlqvist correspondence for modal mucalculus
 STUDIA LOGICA
, 2011
"... We define analogues of modal Sahlqvist formulas for the modal mucalculus, and prove a correspondence theorem for them. ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We define analogues of modal Sahlqvist formulas for the modal mucalculus, and prove a correspondence theorem for them.
Abstract Mucalculus path checking
"... We investigate the path model checking problem for the µcalculus. Surprisingly, restricting to deterministic structures does not allow for more efficient model checking algorithm, as we prove that it can encode any instance of the standard model checking problem for the µcalculus. 1 ..."
Abstract
 Add to MetaCart
We investigate the path model checking problem for the µcalculus. Surprisingly, restricting to deterministic structures does not allow for more efficient model checking algorithm, as we prove that it can encode any instance of the standard model checking problem for the µcalculus. 1
Local abstractionrefinement for the mucalculus
, 2007
"... Counterexampleguided abstraction refinement (CEGAR) is a key technique for the verification of computer programs. Grumberg et al. developed a CEGARbased algorithm for the modal µcalculus. There, every abstract state is split in a refinement step. In this paper, the work of Grumberg et al. is ge ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. is generalized by presenting a new CEGARbased algorithm for the µcalculus. It is based on a more expressive abstract model and applies refinement only locally (at a single abstract state), i.e., the lazy abstraction technique for safety properties is adapted to the µcalculus. Furthermore, it separates
Results 1  10
of
3,709,738