Lower and upper bounds of shortest paths in reachability graphs

DOI10.1155/S0161171204403378zbMath1101.68730MaRDI QIDQ1777827

Niranjan Chakravarthy

Publication date: 25 May 2005

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/52888

zbMATH Keywords

Petri nets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Supervisor reconfiguration for deadlock prevention by resources reallocation

This page was built for publication: Lower and upper bounds of shortest paths in reachability graphs