by Markus Muller-olm
Proc. 16th Symp. on Theoretical Aspects of Computer Science, STACS’99, volume 1563 of LNCS
http://ls5-www.cs.uni-dortmund.de/~mmo/pubs/stacs99.ps.gz
Add To MetaCart
Abstract:
Abstract. We study a logic called FLC (Fixpoint Logic with Chop) that extends the modal mu-calculus by a chop-operator and termination formulae. For this purpose formulae are interpreted by predicate transformers instead of predicates. We show that any context-free process can be characterized by an FLC-formula up to bisimulation or simulation. Moreover, we establish the following results: FLC is strictly more expressive than the modal mu-calculus; it is decidable for finite-state processes but undecidable for context-free processes; satisfiability and validity are undecidable; FLC does not have the finite-model property. 1
Citations
|
2771
|
Introduction to Automata Theory, Languages and Computation
– Hopcroft, Ullman
- 1979
|
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
541
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
257
|
A calculus of duration
– Chaochen, Hoare, et al.
- 1991
|
|
190
|
Algebra of communicating processes with abstraction
– Bergstra, Klop
- 1985
|
|
190
|
Results on the propositional mu-calculus
– Kozen
- 1983
|
|
136
|
A temporal logic for multi-level reasoning about hardware.” Computer Hardware Description Languages and their
– Moszkowski
- 1983
|
|
67
|
On the regular structure of prefix rewriting
– Caucal
- 1992
|
|
64
|
Infinite results
– Moller
- 1996
|
|
35
|
Model checking the full modal mu-calculus for infinite sequential processes
– Burkart, Steffen
- 1997
|
|
34
|
Undecidable equivalences for basic process algebra
– Groote, Huttel
- 1994
|
|
32
|
More infinite results
– Burkart, Esparza
- 1996
|
|
23
|
Characteristic formulae for processes with divergence
– Steffen, Ingólfsdóttir
- 1994
|
|
17
|
More infinite results
– Esparza
- 1996
|
|
7
|
Containment of Regular Languages in Non-Regular Timing Diagrams Languages is Decidable
– Fisler
- 1997
|
|
7
|
Derivation of Characteristic Formulae
– Muller-Olm
- 1998
|
|
2
|
A finite model theorem for the propositional mu-calculus
– Kozen
- 1988
|
|
1
|
Modal mu-calculus, model checking and Gauss elimination
– Mader
- 1995
|
