Pages that link to "Item:Q1164413"
From MaRDI portal
The following pages link to A calculus of total correctness for communicating processes (Q1164413):
Displaying 13 items.
- Computational models for networks of tiny artifacts: a survey (Q465666) (← links)
- A process algebraic view of input/output automata (Q674195) (← links)
- Specification and automatic verification of self-timed queues (Q685115) (← links)
- P-A logic - a compositional proof system for distributed programs (Q757079) (← links)
- A linear-history semantics for languages for distributed programming (Q796298) (← links)
- A more complete model of communicating processes (Q1050768) (← links)
- On the suitability of trace semantics for modular proofs of communicating processes (Q1060004) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- Correctness of concurrent processes (Q1176236) (← links)
- The equivalence in the DCP model (Q1177152) (← links)
- Testing equivalences for processes (Q1348526) (← links)
- Strong fairness and full abstraction for communicating processes (Q1854396) (← links)
- A note on specifying and verifying concurrent processes (Q2265804) (← links)
