Finite Petri nets as models for recursive causal behaviour

DOI10.1016/0304-3975(94)90058-2zbMath0795.68146OpenAlexW2125136584MaRDI QIDQ1318729

Arend Rensink, Goltz, Ursula

Publication date: 5 April 1994

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

Full work available at URL: https://research.utwente.nl/en/publications/finite-petri-nets-as-models-for-recursive-causal-behaviour(00e17354-dc55-4674-8d2f-5ee3db278039).html

zbMATH Keywords

causal dependenciestrace equivalencebranching structurefailure equivalencefinite Petri netsinterleaving behaviourmodels for recursive causal behaviour

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

On the implementation of concurrent calculi in net calculi: two case studies ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS

Cites Work

• Failures semantics based on interval semiwords is a congruence for refinement
• Concurrency and atomicity
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite Petri nets as models for recursive causal behaviour