Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Hierarchical reachability graph generation for Petri nets

From MaRDI portal
Publication:1871862
Jump to:navigation, search

DOI10.1023/A:1020321222420zbMath1020.68058OpenAlexW1482993605MaRDI QIDQ1871862

Peter Buchholz, Peter Kemper

Publication date: 4 May 2003

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020321222420


zbMATH Keywords

Petri netshierarchical structurereachability graphreachability setinvariant analysis


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

Cycles and communicating classes in membrane systems and molecular dynamics ⋮ Nested-unit Petri nets


Uses Software

  • APNN-Toolbox



This page was built for publication: Hierarchical reachability graph generation for Petri nets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1871862&oldid=14263066"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki