1019 search results - page 13 / 204 » Transformations of Petri Nets |
148
click to vote
TII
2011
14 years 4 months ago
2011
Abstract—Software systems that do not meet their timing constraints can cause risks. In this work, we propose a comprehensive method for assessing the risk of timing failure by e...
128
click to vote
BIRTHDAY
2010
Springer
14 years 6 months ago
2010
Springer
Abstract Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the model...
111
click to vote
SAC
2008
ACM
14 years 9 months ago
2008
ACM
Model-Driven Engineering (MDE) has been advocated as an effective way to deal with today's software complexity. MDE can be seen as an integrative approach combining existing ...
GG
2010
Springer
14 years 10 months ago
2010
Springer
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
APN
2010
Springer
15 years 2 months ago
2010
Springer
We prove that plain, bounded, reversible and persistent Petri nets are weakly and strongly separable.