Component-Based Construction of Deadlock-Free Systems

DOI10.1007/978-3-540-24597-1_36zbMath1205.68245OpenAlexW1553922847MaRDI QIDQ5191537

Joseph Sifakis, Gregor Gössler

Publication date: 6 August 2009

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-24597-1_36

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Local and global deadlock-detection in component-based systems are NP-hard ⋮ 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: Component-Based Construction of Deadlock-Free Systems