Add to ORKGThis paper examines FLC, which is the modal -calculus enriched with a sequential composition operator. Bisimulation invariance and the tree model property are proved. Its succinctness is compared to the modal µ-calculus. The main focus lies on FLC's model checking problem over finite transition systems. It is proved to be PSPACE-hard. A tablea
AbstractThe π-calculus is one of the most important mobile process calculi and has been well studied...
AbstractWe explore the finite model theory of the characterisation theorems for modal and guarded fr...
Abstract. The higher-dimensional modal µ-calculus is an extension of the µ-calculus that has been in...
The logic considered in this paper is FLC, fixed point logic with chop. It is an extension of modal...
Abstract. This paper analyses the complexity of model checking Fix-point Logic with Chop – an extens...
This paper analyses the complexity of model checking fixpoint logic with Chop – an extension of the ...
We present a game-based formalism that can be used to do local model checking for FLC, a modal fixed...
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walk...
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness propert...
AbstractIt is widely agreed that the modular method is one of the most effective methods to specify ...
AbstractFixpoint Logic with Chop extends the modal μ-calculus with a sequential composition operator...
AbstractThis note presents a straightforward algorithm for checking whether or not a state of a labe...
Abstract. This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an e...
AbstractIt is known that pushdown processes have a decidable monadic second-order theory (Muller and...
The π-calculus is one of the most important mobile process calculi and has been well studied in the ...
AbstractThe π-calculus is one of the most important mobile process calculi and has been well studied...
AbstractWe explore the finite model theory of the characterisation theorems for modal and guarded fr...
Abstract. The higher-dimensional modal µ-calculus is an extension of the µ-calculus that has been in...
The logic considered in this paper is FLC, fixed point logic with chop. It is an extension of modal...
Abstract. This paper analyses the complexity of model checking Fix-point Logic with Chop – an extens...
This paper analyses the complexity of model checking fixpoint logic with Chop – an extension of the ...
We present a game-based formalism that can be used to do local model checking for FLC, a modal fixed...
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walk...
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness propert...
AbstractIt is widely agreed that the modular method is one of the most effective methods to specify ...
AbstractFixpoint Logic with Chop extends the modal μ-calculus with a sequential composition operator...
AbstractThis note presents a straightforward algorithm for checking whether or not a state of a labe...
Abstract. This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an e...
AbstractIt is known that pushdown processes have a decidable monadic second-order theory (Muller and...
The π-calculus is one of the most important mobile process calculi and has been well studied in the ...
AbstractThe π-calculus is one of the most important mobile process calculi and has been well studied...
AbstractWe explore the finite model theory of the characterisation theorems for modal and guarded fr...
Abstract. The higher-dimensional modal µ-calculus is an extension of the µ-calculus that has been in...