Automata for the Mu-Calculus and Related Results

BRICS Report Series
doi 10.7146/brics.v2i27.19929
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Aarhus University Library

Related search

The Propositional Mu-Calculus Is Elementary

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1984English

Probabilistic Temporal Logics via the Modal Mu-Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1999English

Simply Typed Fixpoint Calculus and Collapsible Pushdown Automata

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2015English

Applying the Mu-Calculus in Planning and Reasoning About Action

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
1998English

Inductive Verification of Hybrid Automata With Strongest Postcondition Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Undecidability Results for Timed Automata With Silent Transitions

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

The Topological Complexity of MSO+U and Related Automata Models

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

Dag-Calculus: A Calculus for Parallel Computation

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy