Results 1  10
of
104,723
Model checking the full modal mucalculus for infinite sequential processes
 Theoretical Computer Science
, 1997
"... Infinitestate systems, contextfree processes, pushdown processes, regular graphs, modal mucalculus, modelchecking. In this paper we develop a new elementary algorithm for modelchecking infinite sequential processes, including contextfree processes, pushdown processes, and regular graphs, that ..."
Abstract

Cited by 40 (0 self)
 Add to MetaCart
Infinitestate systems, contextfree processes, pushdown processes, regular graphs, modal mucalculus, modelchecking. In this paper we develop a new elementary algorithm for modelchecking infinite sequential processes, including contextfree processes, pushdown processes, and regular graphs
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.
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
Incremental Model Checking in the Modal MuCalculus
 IN CAV, VOLUME 818 OF LNCS
, 1994
"... We present an incremental algorithm for model checking in the alternation free fragment of the modal mucalculus, the first incremental algorithm for model checking of which we are aware. The basis for our algorithm, which we call MCI (for Model Checking Incrementally), is a lineartime algorithm d ..."
Abstract

Cited by 41 (3 self)
 Add to MetaCart
We present an incremental algorithm for model checking in the alternation free fragment of the modal mucalculus, the first incremental algorithm for model checking of which we are aware. The basis for our algorithm, which we call MCI (for Model Checking Incrementally), is a lineartime algorithm
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
On the Parallel Complexity of Model Checking in the Modal MuCalculus
 In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science
, 1994
"... The modal mucalculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We show that Model Checking in the Modal MuCalculus (MCMMC)  the problem of checking whether an LTS is a model of a form ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
The modal mucalculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We show that Model Checking in the Modal MuCalculus (MCMMC)  the problem of checking whether an LTS is a model of a
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.
Local ModelChecking of an AlternationFree ValueBased Modal MuCalculus
 In Workshop on Veri Model Checking, and Abstract Interpretation (VMCAI
, 1998
"... Programs written in valuepassing description languages such as Crl and Lotos can be naturally translated into Labelled Transition Systems (Ltss) containing data values. In order to express temporal properties interpreted over these Ltss, we define a valuebased alternationfree modal calculus buil ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
Programs written in valuepassing description languages such as Crl and Lotos can be naturally translated into Labelled Transition Systems (Ltss) containing data values. In order to express temporal properties interpreted over these Ltss, we define a valuebased alternationfree modal calculus
Deductive Systems for the Modal muCalculus
"... We survey deductive systems for the modal µcalculus. The distinguishing feature between different such systems is how minimality of least fixed points is guaranteed. There are basically three ways to achieve this: (i) by induction rules, (ii) by semiformal rules with infinitely many premises, or ( ..."
Abstract
 Add to MetaCart
We survey deductive systems for the modal µcalculus. The distinguishing feature between different such systems is how minimality of least fixed points is guaranteed. There are basically three ways to achieve this: (i) by induction rules, (ii) by semiformal rules with infinitely many premises
Symbolic Model Checking without BDDs
, 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract

Cited by 910 (74 self)
 Add to MetaCart
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis
Results 1  10
of
104,723