Automata as abstractions
From MaRDI portal
Recommendations
Cited in
(19)- Automata methods in transcendence
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- Refinement sensitive formal semantics of state machines with persistent choice
- Process algebra having inherent choice: revised semantics for concurrent systems
- Donut domains: efficient non-convex domains for abstract interpretation
- Abstraction and abstraction refinement
- scientific article; zbMATH DE number 4071019 (Why is no real title available?)
- The Vienna abstract machine
- Abstract interpretation from Büchi automata
- Abstracting abstract machines
- Why These Automata Types?
- Abstraction in fixpoint logic
- More Precise Partition Abstractions
- EDUCATIONAL PEARL: Automata via macros
- Abstraction for branching time properties.
- On the consistency, expressiveness, and precision of partial modeling formalisms
- Compositional verification of sequential programs with procedures
- On model checking multiple hybrid views
- Comparing disjunctive modal transition systems with an one-selecting variant
This page was built for publication: Automata as abstractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711491)