Pages that link to "Item:Q801893"
From MaRDI portal
The following pages link to Results on the propositional \(\mu\)-calculus (Q801893):
Displaying 50 items.
- Verification of \(\mathrm{EB}^3\) specifications using CADP (Q282110) (← links)
- Solving parity games in big steps (Q340584) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- Reducing behavioural to structural properties of programs with procedures (Q385023) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Sahlqvist theorem for modal fixed point logic (Q418010) (← links)
- An algebra of behavioural types (Q418153) (← links)
- Synthesis of Reactive(1) designs (Q439954) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
- Algorithmic correspondence for intuitionistic modal mu-calculus (Q483295) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Spatial logic of tangled closure operators and modal mu-calculus (Q515566) (← links)
- Model-checking games for fixpoint logics with partial order models (Q532389) (← links)
- Faster algorithms for mean-payoff games (Q537946) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- Property specifications for workflow modelling (Q549695) (← links)
- On the completeness and decidability of duration calculus with iteration (Q557828) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← links)
- On the \(\mu \)-calculus over transitive and finite transitive frames (Q606994) (← links)
- On the consistency, expressiveness, and precision of partial modeling formalisms (Q617712) (← links)
- Deciding the existence of uniform interpolants over transitive models (Q627437) (← links)
- Model checking in the modal \(\mu \)-calculus and generic solutions (Q633088) (← links)
- The variable hierarchy for the games \(\mu \)-calculus (Q636308) (← links)
- Completeness for flat modal fixpoint logics (Q638475) (← links)
- Maximal traces and path-based coalgebraic temporal logics (Q639645) (← links)
- Games for the \(\mu\)-calculus (Q671352) (← links)
- Duality and the completeness of the modal \(\mu\)-calculus (Q671986) (← links)
- An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma (Q672383) (← links)
- Synthesis of obfuscation policies to ensure privacy and utility (Q682359) (← links)
- Solving Łukasiewicz \(\mu\)-terms (Q683713) (← links)
- A CCS-based investigation of deadlock in a multi-process electronic mail system (Q688829) (← links)
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems (Q716322) (← links)
- On the modal definability of simulability by finite transitive models (Q763328) (← links)
- Distributed symbolic model checking for \(\mu\)-calculus (Q816198) (← links)
- Reduced models for efficient CCS verification (Q816205) (← links)
- Towards a trustworthy semantics-based language framework via proof generation (Q832282) (← links)
- \(\mu \)MV-algebras: An approach to fixed points in Łukasiewicz logic (Q835129) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Propositional dynamic logic of context-free programs and fixpoint logic with chop (Q845832) (← links)
- Arthur Prior and hybrid logic (Q857663) (← links)
- On the complexity of the two-variable guarded fragment with transitive guards (Q859827) (← links)
- Modal specifications for the control theory of discrete event systems (Q884763) (← links)
- Synthesising correct concurrent runtime monitors (Q888412) (← links)
- Product line process theory (Q898612) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- SnS can be modally characterized (Q914397) (← links)
- Completions of \(\mu \)-algebras (Q925850) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
