Reachability trees for high-level Petri nets

DOI10.1016/0304-3975(86)90046-0zbMath0625.68042OpenAlexW2092311420MaRDI QIDQ579940

Leif O. Jepsen, Kurt Jensen, Arne M. Jensen, Peter J. Huber

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90046-0

zbMATH Keywords

high-level Petri netsreachability trees

Mathematics Subject Classification ID

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

Related Items

Solving high-level Petri games, Symbolic reachability graph and partial symmetries, A symbolic reachability graph for coloured Petri nets, Approximating the buffer allocation problem using epochs, Fifo nets without order deadlock

Cites Work

• System modelling with high-level Petri nets
• Coloured Petri nets and the invariant-method
• Parallel program schemata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item