Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems

DOI10.1007/978-3-642-04420-5_18zbMath1260.68272OpenAlexW1551842063MaRDI QIDQ3646263

Christoph Minnameier, Mila E. Majster-Cederbaum

Publication date: 19 November 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-642-04420-5_18

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Deadlock-freedom in component systems with architectural constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Composition for component-based modeling
• Ensuring Properties of Interaction Systems
• Component-Based Construction of Deadlock-Free Systems
• An Approach to Modelling and Verification of Component Based Systems
• A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems
• Everything Is PSPACE-Complete in Interaction Systems
• Verification, Model Checking, and Abstract Interpretation
• Static Analysis

This page was built for publication: Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems