On the universal and existential fragments of the \(\mu\)-calculus (Q2368950): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Rudiments of \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic in specification. Altrincham, UK, April 8-10, 1987. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modal mu-calculus alternation hierarchy is strict / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixpoint alternation: arithmetic, transition systems, and the binary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time model-checking algorithm for the alternation-free modal mu- calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On model checking for the \(\mu\)-calculus and its fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of quantifiers is better than number of tape cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata for the modal μ-calculus and related results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to branching-time model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property preserving abstractions for the verification of concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>μ</i>-definable sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolants and Symbolic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and simple nested fixpoints / rank
 
Normal rank

Latest revision as of 13:11, 24 June 2024

scientific article
Language Label Description Also known as
English
On the universal and existential fragments of the \(\mu\)-calculus
scientific article

    Statements

    On the universal and existential fragments of the \(\mu\)-calculus (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Automata and logic
    0 references
    \(\mu\)-Calculus
    0 references
    Model checking
    0 references
    Satisfiability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references