Computation tree logic with deadlock detection
From MaRDI portal
Recommendations
Cited in
(16)- Characterizing finite Kripke structures in propositional temporal logic
- A thesis for interaction
- All congruences below stability-preserving fair testing or CFFD
- Off-the-shelf automated analysis of liveness properties for just paths
- Cartesian difference categories
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- Next-preserving branching bisimulation
- Reactive Turing machines
- Sequential composition in the presence of intermediate termination (extended abstract)
- scientific article; zbMATH DE number 7439738 (Why is no real title available?)
- scientific article; zbMATH DE number 7453959 (Why is no real title available?)
- Divide and congruence. III: Stability \& divergence
- scientific article; zbMATH DE number 7243676 (Why is no real title available?)
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
- The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
This page was built for publication: Computation tree logic with deadlock detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401140)