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

DOI10.1109/32.286423zbMath0810.68099OpenAlexW2095603938MaRDI QIDQ4302739

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

Petri netsstate explosion problemconcurrent-software systemsdeadlock statehierarchical reachability graph

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)

Related Items (8)

Modeling, simulation, estimation and boundedness analysis of discrete event systems ⋮ Petri nets for the design and operation of manufacturing systems ⋮ Modular state space analysis of coloured Petri Nets ⋮ Nested-unit Petri nets ⋮ Automatic verification for a class of distributed systems ⋮ Behavior relativity of 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

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