On weak modal compatibility, refinement, and the MIO workbench
From MaRDI portal
Publication:3557076
Recommendations
Cited in
(24)- Stuttering for abstract probabilistic automata
- EXPTIME-completeness of thorough refinement on modal transition systems
- Stuttering for abstract probabilistic automata
- Building a Modal Interface Theory for Concurrency and Data
- Connecting open systems of communicating finite state machines
- Featured Team Automata
- Moving from interface theories to assembly theories
- Richer interface automata with optimistic and pessimistic compatibility
- Interface theories for concurrency and data
- Can we communicate? Using dynamic logic to verify team automata
- ACTL for modal interface automata
- Assembly theories for communication-safe component systems
- Compatibility properties of synchronously and asynchronously communicating components
- A modal interface theory with data constraints
- Modal Open Petri Nets
- Modal Interface Theories for Communication-Safe Component Assemblies
- A generalised theory of interface automata, component compatibility and error
- A generalised theory of interface automata, component compatibility and error
- Extending modal transition systems with structured labels
- A linear-time branching-time perspective on interface automata
- Error-pruning in interface automata
- Compatibility in a multi-component environment
- Nondeterministic modal interfaces
- Interface automata for shared memory
This page was built for publication: On weak modal compatibility, refinement, and the MIO workbench
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557076)