| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Decomposing Petri nets | Julian Rathke
; Pawel Sobocinski
; Owen Stephens
; | Date: |
10 Apr 2013 | Abstract: | In recent work, the second and third authors introduced a technique for
reachability checking in 1-bounded Petri nets, based on wiring decompositions,
which are expressions in a fragment of the compositional algebra of nets with
boundaries. Here we extend the technique to the full algebra and introduce the
related structural property of decomposition width on directed hypergraphs.
Small decomposition width is necessary for the applicability of the
reachability checking algorithm. We give examples of families of nets with
constant decomposition width and develop the underlying theory of
decompositions. | Source: | arXiv, 1304.3121 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |