Partial ordering models for concurrency can be defined operationally

DOI10.1007/BF01388999MaRDI QIDQ1111013zbMATH OpenFDO

Authors Pierpaolo Degano, Sergio Marchetti

Publication date 1987

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

Full work available at URL https://doi.org/10.1007/BF01388999

zbMATH Keywords

concurrencydenotational semanticsFully abstractnessLabelled rewriting systemsoperational semanticspartial orderings of eventspartially ordered multisetspomsetssemantics of concurrent systems

Mathematics Subject Classification ID

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

Review text

Labelled rewriting systems are shown to be powerful enough for defining the semantics of concurrent systems in terms of partial orderings of events, even in the presence of non standard operators like ``N that is not expressible by means of concurrency and sequentialization. This contrast with Pratt's claim [(*)\ \textit{V. Pratt}, ibid. 15, 33-71 (1986; Zbl 0622.68034)]. The main operators proposed by Pratt are used here to construct terms denoting concurrent systems, the behavior of which consists of partially ordered multisets defined operationally. Fully abstractness of the denotational semantics as defined in (*) with respect to the operational one is finally proved.

Recommendations

• scientific article; zbMATH DE number 3995041
• Modeling concurrency with partial orders
• scientific article; zbMATH DE number 4119606
• scientific article; zbMATH DE number 4119653
• scientific article; zbMATH DE number 1361135

Cites work

• A calculus of communicating systems
• A distributed operational semantics of CCS based on condition/event systems
• A partial ordering semantics for CCS
• A Theory of Communicating Sequential Processes
• 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
• 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?)
• 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

(5)

• Modeling concurrency with partial orders
• scientific article; zbMATH DE number 1361135 (Why is no real title available?)
• scientific article; zbMATH DE number 1754584 (Why is no real title available?)
• scientific article; zbMATH DE number 4119606 (Why is no real title available?)
• Partial order aware concurrency sampling

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)