Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis

DOI10.1109/32.286423MaRDI QIDQ4302739zbMATH OpenOpenAlexFDO

Authors Masato Notomi, Tadao Murata

Publication date 4 April 1995

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/32.286423

zbMATH Keywords

concurrent-software systemsdeadlock statehierarchical reachability graphPetri netsstate explosion problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Hierarchical reachability graph generation for Petri nets
• scientific article; zbMATH DE number 969979
• Characterisation of the state spaces of marked graph Petri nets
• Characterisation of the state spaces of live and bounded marked graph Petri nets

Cited in

(13)

• Petri nets for the design and operation of manufacturing systems
• Behavior relativity of Petri nets.
• Hierarchical reachability graph generation for Petri nets
• Modeling, simulation, estimation and boundedness analysis of discrete event systems
• Nested-unit Petri nets
• State space analysis of Petri nets with relation-algebraic methods
• Dynamic slicing of Petri nets based on structural dependency graph and its application in system analysis
• scientific article; zbMATH DE number 6719540 (Why is no real title available?)
• scientific article; zbMATH DE number 3919829 (Why is no real title available?)
• scientific article; zbMATH DE number 1751908 (Why is no real title available?)
• Modular state space analysis of coloured Petri nets
• Automatic verification for a class of distributed systems
• Modeling, reachability and controllability of bounded Petri nets based on semi-tensor product of matrices

This page was built for publication: Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis

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