Results 1  10
of
10,926
The mucalculus and modelchecking
"... Abstract This chapter presents a part of the theory of the mucalculus that is relevant to the, broadly understood, modelchecking problem. The mucalculus is one of the most important logics in modelchecking. It is a logic with an exceptional balance between expressiveness and algorithmic properti ..."
Abstract
 Add to MetaCart
Abstract This chapter presents a part of the theory of the mucalculus that is relevant to the, broadly understood, modelchecking problem. The mucalculus is one of the most important logics in modelchecking. It is a logic with an exceptional balance between expressiveness and algorithmic
Model checking and the Mucalculus
 DIMACS Series in Discrete Mathematics
, 1997
"... There is a growing recognition of the need to apply formal mathematical methods in the design of "high confidence" computing systems. Such systems operate in safety critical contexts (e.g., air traffic control systems) or where errors could have major adverse economic consequences (e.g., ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
attention on a particularly important type of temporal logic known as the Mucalculus.
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 753 (40 self)
 Add to MetaCart
of states. We describe a general method that represents the state space symbolical/y instead of explicitly. The generality of our method comes from using a dialect of the MuCalculus as the primary specification language. We describe a model checking algorithm for MuCalculus formulas that uses Bryant’s
TableauBased Model Checking in the Propositional MuCalculus
 Acta Informatica
, 1990
"... This paper describes a procedure, based around the construction of tableau proofs, for determining whether finitestate systems enjoy properties formulated in the propositional mucalculus. It presents a tableaubased proof system for the logic and proves it sound and complete, and it discusses tech ..."
Abstract

Cited by 102 (7 self)
 Add to MetaCart
This paper describes a procedure, based around the construction of tableau proofs, for determining whether finitestate systems enjoy properties formulated in the propositional mucalculus. It presents a tableaubased proof system for the logic and proves it sound and complete, and it discusses
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
of antecedent failure that escape traditional vacuity analysis, including vacuous actions in temporal modalities and unnecessarily strong temporal operators. Furthermore, we have implemented an efficient redundancy checker for the modal mucalculus in the context of the XMC model checker. Our checker generates
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
The propositional mucalculus is elementary
 of Lecture
"... ABSTRACT: The propositional mucalculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the Propositional Dynamic Logic of Fischer and Ladner, the infinite looping construct of Streett, and the Game Logic of Parikh. We give an elementary time decision p ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
ABSTRACT: The propositional mucalculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the Propositional Dynamic Logic of Fischer and Ladner, the infinite looping construct of Streett, and the Game Logic of Parikh. We give an elementary time decision
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.
The Algebraic MuCalculus and MTBDDs
 In Proceedings of the 5th Workshop on Logic, Language, Information and Computation, (WoLLIC’98
, 1998
"... The paper presents a new calculus (called algebraic mucalculus) which generalizes Park's relational mucalculus by representing arithmetric expressions and realvalued functions rather than formulas and relations. Moreover, we give an algorithm for computing the MTBDDrepresentation of the s ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The paper presents a new calculus (called algebraic mucalculus) which generalizes Park's relational mucalculus by representing arithmetric expressions and realvalued functions rather than formulas and relations. Moreover, we give an algorithm for computing the MTBDD
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
Results 1  10
of
10,926