Results 1  10
of
54
Modal Logics and muCalculi: An Introduction
, 2001
"... We briefly survey the background and history of modal and temporal logics. We then concentrate on the modal mucalculus, a modal logic which subsumes most other commonly used logics. We provide an informal introduction, followed by a summary of the main theoretical issues. We then look at modelchec ..."
Abstract

Cited by 44 (3 self)
 Add to MetaCart
We briefly survey the background and history of modal and temporal logics. We then concentrate on the modal mucalculus, a modal logic which subsumes most other commonly used logics. We provide an informal introduction, followed by a summary of the main theoretical issues. We then look at modelchecking, and finally at the relationship of modal logics to other formalisms.
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 37 (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, that decides the full modal mucalculus. Whereas the actual model checking algorithm results from considering conditional semantics together with backtracking caused by alternation, the corresponding correctness proof requires a stronger framework, which uses dynamic environments modelled by finitestate automata. 1
Local Parallel Model Checking for the Alternation Free µCalculus
 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’01), volume 2031 of LNCS
, 2001
"... In this paper, we describe the design and implementation of (several ... ..."
Abstract

Cited by 32 (6 self)
 Add to MetaCart
In this paper, we describe the design and implementation of (several ...
Why Are Modal Logics So Robustly Decidable?
"... Modal logics are widely used in a number of areas in computer science, in particular ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
Modal logics are widely used in a number of areas in computer science, in particular
Monadic Second Order Logic on TreeLike Structures
, 1996
"... An operation M* which constructs from a given structure M a treelike structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata running on such treelike structures is defined. It is shown that automata of this kind characterise expressive power of ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
An operation M* which constructs from a given structure M a treelike structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata running on such treelike structures is defined. It is shown that automata of this kind characterise expressive power of monadic second order logic (MSOL) over treelike structures. Using this characterisation it is proved that MSOL theory of treelike structures is effectively reducible to that of the original structures. As another application of the characterisation it is shown that MSOL on trees of arbitrary degree is equivalent to first order logic extended with unary least fixpoint operator.
Inflationary Fixed Points in Modal Logic
, 2002
"... We consider an extension of modal logic with an operator for constructing... ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
We consider an extension of modal logic with an operator for constructing...