Pages that link to "Item:Q1124314"
From MaRDI portal
The following pages link to The \(\mu\)-calculus as an assertion-language for fairness arguments (Q1124314):
Displaying 9 items.
- Deductive verification of alternating systems (Q939163) (← links)
- Merging regular processes by means of fixed-point theory (Q1082070) (← links)
- Completing the temporal picture (Q1176248) (← links)
- Proving partial order properties (Q1322161) (← links)
- A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
- Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata (Q1709455) (← links)
- A compositional approach to CTL\(^*\) verification (Q1770366) (← links)
- Verification by augmented finitary abstraction (Q1854391) (← links)
- Model checking with strong fairness (Q2505624) (← links)
