scientific article
From MaRDI portal
Publication:3851636
zbMath0418.68056MaRDI QIDQ3851636
Glynn Winskel, Mogens Nielsen, Gordon D. Plotkin
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
concurrencyPetri-netspartial ordersdomain theoryevent structurescausal netsK-densitydistance of eventsinformation pointsoccurence netsprime algebraic complete lattices
Partial orders, general (06A06) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Lattices (06B99)
Related Items (20)
On concurrent games with payoff ⋮ Declarative event based models of concurrency and refinement in psi-calculi ⋮ Petri nets, algebras, morphisms, and compositionality ⋮ Synchronization trees ⋮ Coalgebraic Semantic Model for the Clock Constraint Specification Language ⋮ ST-structures ⋮ Contextual equivalences in configuration structures and reversibility ⋮ Aligning event logs to resource-constrained \(\nu \)-Petri nets ⋮ Efficient semantics-based compliance checking using LTL formulae and unfolding ⋮ Reasoning about causality in games ⋮ Towards a categorical representation of reversible event structures ⋮ A stable non-interleaving early operational semantics for the pi-calculus ⋮ Normal forms, linearity, and prime algebraicity over nonflat domains ⋮ Causal Unfoldings ⋮ On the Origin of Events: Branching Cells as Stubborn Sets ⋮ A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus ⋮ Formal Relationships Between Geometrical and Classical Models for Concurrency ⋮ Synchronous Kleene algebra ⋮ Event structure semantics of (controlled) reversible CCS ⋮ Quasi-optimal partial order reduction
This page was built for publication:
