Partial ordering models for concurrency can be defined operationally

DOI10.1007/BF01388999zbMath0657.68029MaRDI QIDQ1111013

Pierpaolo Degano, Sergio Marchetti

Publication date: 1987

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

zbMATH Keywords

operational semanticsdenotational semanticsconcurrencypartially ordered multisetspomsetsFully abstractnessLabelled rewriting systemspartial orderings of eventssemantics of concurrent systems

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algèbre de processus et synchronisation
• A partial ordering semantics for CCS
• Concurrent histories: a basis for observing distributed systems
• Modeling concurrency with partial orders
• Petri nets, algebras, morphisms, and compositionality
• A distributed operational semantics of CCS based on condition/event systems
• Behaviours of concurrent systems
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Fully abstract models of typed \(\lambda\)-calculi
• The non-sequential behaviour of Petri nets
• CIRCAL and the representation of communication, concurrency, and time
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: Partial ordering models for concurrency can be defined operationally