Component-Based Construction of Deadlock-Free Systems
From MaRDI portal
Recommendations
Cited in
(15)- Local and global deadlock-detection in component-based systems are NP-hard
- Deadlock-freedom in component systems with architectural constraints
- scientific article; zbMATH DE number 1693513 (Why is no real title available?)
- Analyzing component-based systems on the basis of architectural constraints
- Formal deadlock elimination in an object oriented conceptual schema
- Ensuring Properties of Interaction Systems
- Robustness in Interaction Systems
- Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems
- Construction of Deadlock-free Designs of Communication Protocols from Observations
- scientific article; zbMATH DE number 7314999 (Why is no real title available?)
- Formal Methods for Components and Objects
- Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets
- A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems
- Everything Is PSPACE-Complete in Interaction Systems
- An extensional treatment of lazy data flow deadlock
This page was built for publication: Component-Based Construction of Deadlock-Free Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191537)