Configuration structures, event structures and Petri nets

DOI10.1016/j.tcs.2009.06.014zbMath1187.68329arXiv0912.4023OpenAlexW2024955813MaRDI QIDQ843106

Robert J. van Glabbeek, Gordon D. Plotkin

Publication date: 29 September 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.4023

zbMATH Keywords

propositional logicPetri netsconcurrencyevent structuresconfiguration structures

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Declarative event based models of concurrency and refinement in psi-calculi, Domain and event structure semantics for Petri nets with read and inhibitor arcs, Configuration structures, event structures and Petri nets, Schedulers and Finishers: On Generating the Behaviours of an Event Structure, ST-structures, Contextual equivalences in configuration structures and reversibility, Languages of higher-dimensional automata, Unnamed Item, Reversibility and asymmetric conflict in event structures, Causal dynamic inference, A stable non-interleaving early operational semantics for the pi-calculus, Causality analysis and fault ascription in component-based systems, Modeling dependencies and simultaneity in membrane system computations, Independence Abstractions and Models of Concurrency, Abstract processes of place/transition systems, Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures, Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict, Unnamed Item, Unnamed Item, Open Petri nets, Branching Processes of General Petri Nets, On the Origin of Events: Branching Cells as Stubborn Sets, Spreading nets: a uniform approach to unfoldings, Flow Unfolding of Multi-clock Nets, Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly, Event Identifier Logic, Unnamed Item, Schedulers and finishers: on generating and filtering the behaviours of an event structure, Abstract processes and conflicts in place/transition systems, Concurrent semantics for fusions: weak prime domains and connected event structures, Event-based functional decomposition, On Causal Semantics of Petri Nets, Dynamic Causality in Event Structures, Minimisation of event structures, Zero-safe nets: Comparing the collective and individual token approaches., Dynamic connectors for concurrency

Cites Work

• Models for concurrency: Towards a classification
• An event structure semantics for general Petri nets
• On the nature of events: another perspective in concurrency
• Using information systems to solve recursive domain equations
• Configuration structures, event structures and Petri nets
• Erratum to ``On the expressiveness of higher dimensional automata
• Sequential and concurrent behaviour in Petri net theory
• \(\mathbb{T}^\omega\) as a universal domain
• Petri nets, event structures and domains. I
• Semantical investigations in Heyting's intuitionistic logic
• Branching processes of Petri nets
• Semantics of systems of concurrent processes. LITP Spring School on theoretical computer science, La Roche Posay, France, 23-27 April 1990. Proceedings
• Causal automata
• Contextual Petri nets, asymmetric event structures, and processes
• Concurrent bisimulations in Petri nets
• The unfolding of general Petri nets
• The non-sequential behaviour of Petri nets
• Mathematical Foundations of Computer Science 2004
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item