DMCA
Deriving Petri Nets from Finite Transition Systems (1998)
| Venue: | IEEE Transactions on Computers |
| Citations: | 80 - 8 self |
BibTeX
@ARTICLE{Cortadella98derivingpetri,
author = {Jordi Cortadella and Michael Kishinevsky and Luciano Lavagno and Alexandre Yakovlev},
title = {Deriving Petri Nets from Finite Transition Systems},
journal = {IEEE Transactions on Computers},
year = {1998},
volume = {47},
pages = {859--882}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents a novel method to derive a Petri net from any specification model that can be mapped into a state-based representation with arcs labeled with symbols from an alphabet of events (a Transition System, TS). The method is based on the theory of regions for Elementary Transition Systems (ETS). Previous work has shown that for any ETS there exists a Petri net with minimum transition count (one transition for each label) with a reachability graph isomorphic to the original Transition System. The method makes use of the following three mechanisms, providing a framework for synthesis of safe Petri nets from arbitrary TSs. Firstly, the requirement of isomorphism is relaxed to a "more behavioural" form of equivalence, bisimulation of TSs, thus extending the class of synthesizable TSs to a new class called Excitation-Closed Transition Systems(ECTS). Secondly, previous work required an oracle (usually the designer) to identify sets of events labeling the TS that were mapped to...
Keyphrases
petri net finite transition system previous work elementary transition system excitation-closed transition system new class transition system specification model behavioural form reachability graph minimum transition count safe petri net arbitrary tss original transition system synthesizable tss state-based representation novel method
