Robustness in Interaction Systems

DOI10.1007/978-3-540-73196-2_21zbMath1215.68068OpenAlexW1854116674MaRDI QIDQ3612362

Moritz Martens, Mila E. Majster-Cederbaum

Publication date: 10 March 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-73196-2_21

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Rigorous development of component-based systems using component metadata and patterns

Uses Software

• PROMETHEUS

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity results for 1-safe nets
• Composition for component-based modeling
• Ensuring Properties of Interaction Systems
• Proving the Correctness of Multiprocess Programs
• 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
• Verification, Model Checking, and Abstract Interpretation
• Formal Methods for Components and Objects
• Formal Methods for Components and Objects

This page was built for publication: Robustness in Interaction Systems