scientific article
From MaRDI portal
zbMath0664.68060MaRDI QIDQ3815533
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
A partial trace semantics for Petri nets, Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence), Executions: A new partial-order semantics of Petri nets, Fairness and partial order semantics, Partial Order Semantics of Types of Nets, Step failures semantics and a complete proof system, Executability of scenarios in Petri nets, Unifying Petri Net Semantics with Token Flows, Pomset Languages of Finite Step Transition Systems, Failures semantics based on interval semiwords is a congruence for refinement, Finite Petri nets as models for recursive causal behaviour, Firing partial orders in a Petri net
