1994
DOI: 10.1007/3-540-58152-9_23
|View full text |Cite
|
Sign up to set email alerts
|

Petri net analysis using boolean manipulation

Abstract: This paper presents a novel analysis approach for bounded Petri nets. The net behavior is modeled by boolean functions, thus reducing reasoning about Petri nets to boolean calculation. The state explosion problem is managed by using Binary Decision Diagrams (BDDs), which are capable to represent large sets of markings in small data structures.The ability o f P etri nets to model systems, the exibility and generality of boolean algebras, and the e cient implementation of BDDs, provide a general environment to h… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
64
0

Year Published

1999
1999
2021
2021

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 121 publications
(64 citation statements)
references
References 10 publications
0
64
0
Order By: Relevance
“…• Slotted ring network protocol (Slot) [25] models a protocol for local area networks. N is the number of nodes in the network.…”
Section: Resultsmentioning
confidence: 99%
“…• Slotted ring network protocol (Slot) [25] models a protocol for local area networks. N is the number of nodes in the network.…”
Section: Resultsmentioning
confidence: 99%
“…Therefore, we have developed our algorithms with the free package BuDDy [16] for both the symbolic observation graph construction and the whole state space construction. The implementation of the Img and P reimg operations is similar to the one of [17]. All the tested examples are parameterized and the size of the reachable states space is exponential with respect to the parameter value.…”
Section: Evaluation Of the Observation Methodsmentioning
confidence: 99%
“…The system models a protocol for Local Area Networks called slotted ring [17]. The network is composed of n vertices.…”
Section: Slotted Ringmentioning
confidence: 99%
“…Symbolic analysis of PNs su er from the state explosion problem 18,19]. The number of reachable markings grows exponentially with the size of the PN description.…”
Section: Introductionmentioning
confidence: 99%