On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Characteristic formulae for processes with divergence
Information and Computation
Undecidable equivalences for basic process algebra
Information and Computation
Communication and Concurrency
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Modal µ-Calculus, Model Checking and Gauß Elimination
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Action Refinement from a Logical Point of View
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Local Model Checking Games for Fixed Point Logic with Chop
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Model Checking Fixed Point Logic with Chop
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Propositional dynamic logic of context-free programs and fixpoint logic with chop
Information Processing Letters
The alternation hierarchy in fixpoint logic with chop is strict too
Information and Computation
Compositional Properties of Sequential Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Model checking the first-order fragment of higher-order fixpoint logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On hierarchically developing reactive systems
Information and Computation
Connection between logical and algebraic approaches to concurrent systems†
Mathematical Structures in Computer Science
Regular linear temporal logic with past
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
The complexity of model checking higher order fixpoint logic
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Compositionality of fixpoint logic with chop
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
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.