A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems

DOI10.1007/978-3-540-69507-3_77MaRDI QIDQ5448822zbMATH OpenOpenAlexFDO

Authors Moritz Martens, Christoph Minnameier, Mila Majster-Cederbaum

Publication date 7 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69507-3_77

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Local and global deadlock-detection in component-based systems are NP-hard
• Checking deadlock-freedom of parametric component-based systems
• Deadlock-freedom in component systems with architectural constraints
• Component-Based Construction of Deadlock-Free Systems
• Verification, Model Checking, and Abstract Interpretation

Cited in

(10)

• Checking deadlock-freedom of parametric component-based systems
• Local and global deadlock-detection in component-based systems are NP-hard
• Deadlock-freedom in component systems with architectural constraints
• Rigorous development of component-based systems using component metadata and patterns
• Robustness in Interaction Systems
• Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems
• Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets
• Everything Is PSPACE-Complete in Interaction Systems
• Verification, Model Checking, and Abstract Interpretation
• Checking deadlock-freedom of parametric component-based systems

This page was built for publication: A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448822)