Pages that link to "Item:Q3557076"
From MaRDI portal
The following pages link to On Weak Modal Compatibility, Refinement, and the MIO Workbench (Q3557076):
Displaying 19 items.
- Compatibility in a multi-component environment (Q383353) (← links)
- Interface theories for concurrency and data (Q549177) (← links)
- EXPTIME-completeness of thorough refinement on modal transition systems (Q690504) (← links)
- Connecting open systems of communicating finite state machines (Q2011202) (← links)
- A linear-time branching-time perspective on interface automata (Q2182669) (← links)
- Moving from interface theories to assembly theories (Q2340257) (← links)
- Richer interface automata with optimistic and pessimistic compatibility (Q2350491) (← links)
- ACTL for modal interface automata (Q2404073) (← links)
- A generalised theory of interface automata, component compatibility and error (Q2415373) (← links)
- Stuttering for abstract probabilistic automata (Q2436515) (← links)
- Error-pruning in interface automata (Q2517232) (← links)
- Nondeterministic modal interfaces (Q2629098) (← links)
- Interface automata for shared memory (Q2675806) (← links)
- A Generalised Theory of Interface Automata, Component Compatibility and Error (Q2814126) (← links)
- Building a Modal Interface Theory for Concurrency and Data (Q2890318) (← links)
- Extending modal transition systems with structured labels (Q2909731) (← links)
- A Modal Interface Theory with Data Constraints (Q2999311) (← links)
- Modal Interface Theories for Communication-Safe Component Assemblies (Q3105749) (← links)
- Stuttering for Abstract Probabilistic Automata (Q3455842) (← links)
