UNITY and Büchi automata
From MaRDI portal
Publication:2026375
Recommendations
Cites work
- A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
- A predicate transformer for the progress property `to-always'
- Computation calculus bridging a formalization gap
- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL
- Distributed cooperation with action systems
- DUALITY: A simple formalism for the analysis of UNITY
- scientific article; zbMATH DE number 1639446 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 2077135 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- Predicate transformers for reasoning about concurrent computation
- Programs, Recursion and Unbounded Choice
- The existence of refinement mappings
Cited in
(3)
This page was built for publication: UNITY and Büchi automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2026375)