Partial ordering models for concurrency can be defined operationally
From MaRDI portal
DOI10.1007/BF01388999zbMATH Open0657.68029MaRDI QIDQ1111013FDOQ1111013
Pierpaolo Degano, Sergio Marchetti
Publication date: 1987
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Recommendations
concurrencydenotational semanticsoperational semanticspartially ordered multisetspomsetsFully abstractnessLabelled rewriting systemspartial orderings of eventssemantics of concurrent systems
Cites Work
- Petri nets, event structures and domains. I
- Process algebra for synchronous communication
- Modeling concurrency with partial orders
- A calculus of communicating systems
- The non-sequential behaviour of Petri nets
- Time, clocks, and the ordering of events in a distributed system
- A Theory of Communicating Sequential Processes
- Algèbre de processus et synchronisation
- Title not available (Why is that?)
- Fully abstract models of typed \(\lambda\)-calculi
- Concurrent histories: a basis for observing distributed systems
- A distributed operational semantics of CCS based on condition/event systems
- CIRCAL and the representation of communication, concurrency, and time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Petri nets, algebras, morphisms, and compositionality
- A partial ordering semantics for CCS
- Behaviours of concurrent systems
- Title not available (Why is that?)
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)
