A partial trace semantics for Petri nets
From MaRDI portal
Publication:1341743
DOI10.1016/0304-3975(94)90280-1zbMath0823.68058OpenAlexW2019980178MaRDI QIDQ1341743
Publication date: 9 January 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90280-1
Network design and communication in computer systems (68M10) Semantics in the theory of computing (68Q55)
Related Items (4)
On the synchronization of semi-traces ⋮ Asynchronous cellular automata for pomsets without auto-concurrency ⋮ Using transition set sequences to partition behaviors of Petri nets ⋮ Asynchronous cellular automata for pomsets
Cites Work
- Modular construction and partial order semantics of Petri nets
- Partial commutations and faithful rational transductions
- Combinatorics on traces
- An extension of the notions of traces and of asynchronous automata
- Semi-commutations and rational expressions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A partial trace semantics for Petri nets
