Liveness, fairness, and recurrence in Petri nets

DOI10.1016/S0020-0190(99)00074-5MaRDI QIDQ1583049zbMATH OpenOpenAlexDBLPWikidataFDO

Authors R. Smith

Publication date 26 October 2000

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(99)00074-5

zbMATH Keywords

Concurrencydistributed systemsPetri netstheory of computation

Mathematics Subject Classification ID

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

Cited in

(3)

• The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
• Soundness of workflow nets: classification, decidability, and analysis
• Analysis of UML Activities Using Dynamic Meta Modeling

This page was built for publication: Liveness, fairness, and recurrence in Petri nets

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