Shortest paths in reachability graphs

DOI10.1006/jcss.1995.1070zbMath0831.68069OpenAlexW2081653724MaRDI QIDQ1900935

Javier Esparza, Jörg Desel

Publication date: 25 October 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1995.1070

zbMATH Keywords

Petri netsreachability graphsafe marked graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Regular marked Petri nets ⋮ An Expansion Property of Boolean Linear Maps ⋮ Reduction using induced subnets to systematically prove properties for free-choice nets

This page was built for publication: Shortest paths in reachability graphs