Robustness in Interaction Systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1759635 (Why is no real title available?)
- scientific article; zbMATH DE number 1390331 (Why is no real title available?)
- A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems
- A calculus for modeling software components.
- An Approach to Modelling and Verification of Component Based Systems
- Complexity results for 1-safe nets
- Component-Based Construction of Deadlock-Free Systems
- Composition for component-based modeling
- Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets
- Ensuring Properties of Interaction Systems
- Formal Methods for Components and Objects
- Proving the Correctness of Multiprocess Programs
- Verification, Model Checking, and Abstract Interpretation
Cited in
(3)
This page was built for publication: Robustness in Interaction Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612362)