Structural reductions and stutter sensitive properties
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1670781 (Why is no real title available?)
- scientific article; zbMATH DE number 1696466 (Why is no real title available?)
- scientific article; zbMATH DE number 3980500 (Why is no real title available?)
- scientific article; zbMATH DE number 177511 (Why is no real title available?)
- scientific article; zbMATH DE number 1487477 (Why is no real title available?)
- scientific article; zbMATH DE number 1759609 (Why is no real title available?)
- A theorem on atomicity in distributed algorithms
- Automata-Theoretic Model Checking Revisited
- Automated Technology for Verification and Analysis
- Covering step graph preserving failure semantics
- LTL under reductions with weaker conditions than stutter invariance
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
- More scalable LTL model checking via discovering design-space dependencies \((D^3)\)
- Reduction
- Structural reductions and stutter sensitive properties
- Structural reductions revisited
- Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
This page was built for publication: Structural reductions and stutter sensitive properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6960759)