Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm
From MaRDI portal
Publication:1914039
DOI10.1007/BF01214554zbMath0846.68067OpenAlexW2045329258MaRDI QIDQ1914039
Frank Dederichs, Ketil Stølen, Rainer Weber
Publication date: 2 June 1996
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01214554
Related Items
Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency ⋮ Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm ⋮ Assumption-Commitment Support for CSP Model Checking ⋮ Implementing Services by Partial State Machines ⋮ Assumption-commitment support for CSP model checking
Uses Software
Cites Work
- P-A logic - a compositional proof system for distributed programs
- The existence of refinement mappings
- Defining liveness
- Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
- Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm
- The specification statement
- An axiomatic basis for computer programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item