64 search results - page 2 / 13 » A Symbolic Algorithm for the Synthesis of Bounded Petri Nets |
APN
2007
Springer
13 years 11 months ago
2007
Springer
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
BPM
2006
Springer
13 years 6 months ago
2006
Springer
The theory of regions and the algorithms for synthesizing a Petri net model from a transition system, which are based on this theory, have interesting practical applications
ACSD
2009
IEEE
13 years 10 months ago
2009
IEEE
The application of synthesis of Petri nets from languages for practical problems has recently attracted increasing attention. However, the classical synthesis problems are often n...
TACAS
2009
Springer
13 years 11 months ago
2009
Springer
The ITPN-PerfBound is a tool for the modeling and analysis of Interval Time Petri Nets (ITPN), that is Petri Nets in which firing time intervals, and possibly firing frequency in...
APN
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...