Partial ordering models for concurrency can be defined operationally
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3821089 (Why is no real title available?)
- scientific article; zbMATH DE number 4035159 (Why is no real title available?)
- scientific article; zbMATH DE number 4094831 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- A Theory of Communicating Sequential Processes
- A calculus of communicating systems
- A distributed operational semantics of CCS based on condition/event systems
- A partial ordering semantics for CCS
- Algèbre de processus et synchronisation
- Behaviours of concurrent systems
- CIRCAL and the representation of communication, concurrency, and time
- Concurrent histories: a basis for observing distributed systems
- Fully abstract models of typed \(\lambda\)-calculi
- Modeling concurrency with partial orders
- Petri nets, algebras, morphisms, and compositionality
- Petri nets, event structures and domains. I
- Process algebra for synchronous communication
- The non-sequential behaviour of Petri nets
- Time, clocks, and the ordering of events in a distributed system
Cited in
(4)
This page was built for publication: Partial ordering models for concurrency can be defined operationally
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111013)
