1099 search results - page 40 / 220 » Petri net ontology |
BIRTHDAY
2005
Springer
14 years 4 months ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
AUTOMATICA
2005
13 years 11 months ago
2005
The number of states in discrete event systems can increase exponentially with respect to the size of the system. A way to face this state explosion problem consists of relaxing t...
AC
2003
Springer
14 years 4 months ago
2003
Springer
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
APN
2006
Springer
14 years 2 months ago
2006
Springer
We consider nested nets, i.e. Petri nets in which tokens can be Petri nets themselves. We study value semantics of nested nets rather than reference semantics, and apply nested ne...
QEST
2009
IEEE
14 years 5 months ago
2009
IEEE
Abstract—ITPN-PerfBound is a graphical tool for the modeling and performance bound analysis of Interval Time Petri Nets (ITPN), that has been developed within the DrawNET modelin...