Pages that link to "Item:Q801893"
From MaRDI portal
The following pages link to Results on the propositional \(\mu\)-calculus (Q801893):
Displaying 50 items.
- Deductive verification of alternating systems (Q939163) (← links)
- Cut-free sequent systems for temporal logic (Q941433) (← links)
- Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
- Ł\(\Pi\) logic with fixed points (Q953281) (← links)
- Comparing disjunctive modal transition systems with an one-selecting variant (Q953529) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Invariants for parameterised Boolean equation systems (Q960855) (← links)
- Strategy logic (Q979080) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- On the proof theory of the modal mu-calculus (Q1005937) (← links)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
- On modal \(\mu \)-calculus and Gödel-Löb logic (Q1015480) (← links)
- Systems of agents controlled by logical programs: complexity of verification (Q1040334) (← links)
- A decidable class of problems for control under partial observation (Q1041809) (← links)
- Uniform inevitability is tree automaton ineffable (Q1108048) (← links)
- Logical definability of fixed points (Q1114673) (← links)
- A linear algorithm to solve fixed-point equations on transition systems (Q1115196) (← links)
- A finite model theorem for the propositional \(\mu\)-calculus (Q1117213) (← links)
- An automata theoretic decision procedure for the propositional mu- calculus (Q1119630) (← links)
- Duality for modal \(\mu\)-logics (Q1128984) (← links)
- A note on model checking the modal \(\nu\)-calculus (Q1176250) (← links)
- Local model checking in the modal mu-calculus (Q1177939) (← links)
- Local model checking for infinite state spaces (Q1190489) (← links)
- Symbolic model checking: \(10^{20}\) states and beyond (Q1193587) (← links)
- Concurrent common knowledge: Defining agreement for asynchronous systems (Q1200914) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- A compositional \(\mu\)-calculus proof system for statecharts processes (Q1285661) (← links)
- The formalization and analysis of a communications protocol (Q1318284) (← links)
- Model checking and boolean graphs (Q1325844) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- Assisting requirement formalization by means of natural language translation (Q1329090) (← links)
- Property preserving abstractions for the verification of concurrent systems (Q1346649) (← links)
- On modal mu-calculus and Büchi tree automata (Q1349728) (← links)
- Simple proof techniques for property preservation via simulation (Q1350106) (← links)
- Extension of synthesis algorithm of recursive processes to \(\mu\)-calculus (Q1350215) (← links)
- Fast and simple nested fixpoints (Q1350911) (← links)
- Proving properties of dynamic process networks (Q1383156) (← links)
- Axiomatising extended computation tree logic (Q1389439) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Completeness of Park induction (Q1391869) (← links)
- Program schemata vs. automata for decidability of program logics (Q1392141) (← links)
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL (Q1395428) (← links)
- On the equational definition of the least prefixed point. (Q1401250) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Symbolic model checking for \(\mu\)-calculus requires exponential time (Q1575656) (← links)
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
