Petri nets, algebras, morphisms, and compositionality

DOI10.1016/0890-5401(87)90032-0zbMath0622.68052OpenAlexW2086302464MaRDI QIDQ1091145

Glynn Winskel

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90032-0

zbMATH Keywords

behaviourmodels of concurrencycommunicating sequential processesparallel compositioncalculus of communicating systemscategory of Petri netstwo sorted algebras over multisets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Special categories (18B99) Theory of operating systems (68N25)

Related Items

Automatizing parametric reasoning on distributed concurrent systems, A compositional proof system on a category of labelled transition systems, A distributed operational semantics of CCS based on condition/event systems, Partial ordering models for concurrency can be defined operationally, Property-preserving transformations of elementary net systems based on morphisms, Unfolding semantics of graph transformation, An algebraic view of interleaving and distributed operational semantics for CCS, On the category of Petri net computations, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Computing alignments with maximum synchronous moves via replay in coordinate planes, Calculi of net structures and sets are similar, A partial ordering semantics for CCS, Unfolding-based diagnosis of systems with an evolving topology, Petri nets are monoids, Grammar Morphisms and Weakly Adhesive Categories, An event structure semantics for general Petri nets, Process versus unfolding semantics for Place/Transition Petri nets, Petri nets and bisimulation, On the implementation of concurrent calculi in net calculi: two case studies, Trellis processes: a compact representation for runs of concurrent systems, Partial order techniques for distributed discrete event systems: why you cannot avoid using them, Causality for mobile processes, Bipartite graphs as polynomials and polynomials as bipartite graphs, Refinement of actions in event structures and causal trees, An algebraic characterisation of elementary net system (observable) state space, Processes and unfoldings: concurrent computations in adhesive categories, The structure of first-order causality, Non-interleaving semantics for mobile processes, Zero-safe nets: Comparing the collective and individual token approaches., Functorial models for Petri nets

Cites Work

• Petri nets and bisimulation
• Calculi for synchrony and asynchrony
• Net theory and applications. Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, October 8-19, 1979. Ed. by Wilfried Brauer
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Formal semantics of a class of high-level primitives of coordinating concurrent processes
• Communicating sequential processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item