1369 search results - page 56 / 274 » On the Semantics of Petri Nets |
BIRTHDAY
2005
Springer
15 years 5 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 ...
130
click to vote
COORDINATION
2006
Springer
15 years 3 months ago
2006
Springer
Bigraphical Reactive Systems have been proposed as a meta model for global ubiquitous computing generalising process calculi for mobility such as the pi-calculus and the Mobile Amb...
108
click to vote
AUTOMATICA
2005
14 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
15 years 5 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...
QEST
2009
IEEE
15 years 6 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...