Liveness, fairness, and recurrence in Petri nets

DOI10.1016/S0020-0190(99)00074-5zbMath0953.68575OpenAlexW1999970959WikidataQ57006192 ScholiaQ57006192MaRDI QIDQ1583049

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

distributed systemsPetri netstheory of computationConcurrency

Mathematics Subject Classification ID

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

Related Items (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