Petri Nets and Marked Graphs--Mathematical Models of Concurrent Computation

DOI10.2307/2320826MaRDI QIDQ4745266zbMATH OpenOpenAlexFDO

Authors Richard Johnsonbaugh, Tadao Murata

Publication date 1982

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2320826

zbMATH Keywords

concurrency

Mathematics Subject Classification ID

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

Cited in

(3)

• Fair relation and modified synchronic distances in a Petri net
• Structure matrices for Petri nets and their applications
• Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable

This page was built for publication: Petri Nets and Marked Graphs--Mathematical Models of Concurrent Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745266)