MIO Workbench
From MaRDI portal
Software:21741
No author found.
Related Items (28)
Refinement and Asynchronous Composition of Modal Petri Nets ⋮ Building a Modal Interface Theory for Concurrency and Data ⋮ Nondeterministic modal interfaces ⋮ Stuttering for Abstract Probabilistic Automata ⋮ Extending modal transition systems with structured labels ⋮ ACTL for modal interface automata ⋮ Compatibility in a multi-component environment ⋮ A linear-time branching-time perspective on interface automata ⋮ A generalised theory of interface automata, component compatibility and error ⋮ Interface automata for shared memory ⋮ Modal transition system encoding of featured transition systems ⋮ Stuttering for abstract probabilistic automata ⋮ A Modal Interface Theory with Data Constraints ⋮ On Weak Modal Compatibility, Refinement, and the MIO Workbench ⋮ EXPTIME-completeness of thorough refinement on modal transition systems ⋮ MoTraS: A Tool for Modal Transition Systems and Their Extensions ⋮ Assembly Theories for Communication-Safe Component Systems ⋮ Interface theories for concurrency and data ⋮ Connecting open systems of communicating finite state machines ⋮ Error-pruning in interface automata ⋮ A Generalised Theory of Interface Automata, Component Compatibility and Error ⋮ Logical vs. behavioural specifications ⋮ Modal Interface Theories for Communication-Safe Component Assemblies ⋮ Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory ⋮ On Refinements of Boolean and Parametric Modal Transition Systems ⋮ Unnamed Item ⋮ Moving from interface theories to assembly theories ⋮ Richer interface automata with optimistic and pessimistic compatibility
This page was built for software: MIO Workbench
