Deadlock-freedom in component systems with architectural constraints
From MaRDI portal
Publication:2441719
DOI10.1007/s10703-012-0160-6zbMath1284.68043OpenAlexW2073577817MaRDI QIDQ2441719
Moritz Martens, Mila E. Majster-Cederbaum
Publication date: 28 March 2014
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-012-0160-6
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical problems of computer architecture (68M07)
Cites Work
- CCS expressions, finite state processes, and three problems of equivalence
- Composition for component-based modeling
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Deadlock analysis in networks of communicating processes
- Analyzing Component-Based Systems on the Basis of Architectural Constraints
- Ensuring Properties of Interaction Systems
- Automatic Verification of Directory-Based Consistency Protocols
- Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Graph-Based Algorithms for Boolean Function Manipulation
- The multiway rendezvous
- Three Partition Refinement Algorithms
- Distributed cooperation with action systems
- A Proof System for Communicating Sequential Processes
- Component-Based Construction of Deadlock-Free Systems
- Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
