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

DOI10.1007/978-3-540-69507-3_77zbMath1131.68304OpenAlexW1581159190MaRDI QIDQ5448822

Christoph Minnameier, Moritz Martens, Mila E. 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)

Related Items (7)

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

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