MIO Workbench

swMATH9762MaRDI QIDQ21741FDOQ21741

Author name not available (Why is that?)

Cited In (28)

• Stuttering for abstract probabilistic automata
• Stuttering for abstract probabilistic automata
• EXPTIME-completeness of thorough refinement on modal transition systems
• Building a Modal Interface Theory for Concurrency and Data
• Connecting open systems of communicating finite state machines
• On weak modal compatibility, refinement, and the MIO workbench
• Moving from interface theories to assembly theories
• Richer interface automata with optimistic and pessimistic compatibility
• Interface theories for concurrency and data
• On refinements of Boolean and parametric modal transition systems
• ACTL for modal interface automata
• Assembly theories for communication-safe component systems
• A modal interface theory with data constraints
• 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
• Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
• Logical vs. behavioural specifications
• Modal specification theories for component-based design
• A linear-time branching-time perspective on interface automata
• Refinement and asynchronous composition of modal Petri nets
• Error-pruning in interface automata
• Nondeterministic modal interfaces
• Compatibility in a multi-component environment
• Interface automata for shared memory
• MoTraS: a tool for modal transition systems and their extensions
• Modal transition system encoding of featured transition systems

This page was built for software: MIO Workbench