Sciweavers

231 search results - page 10 / 47
» Time Recursive Petri Nets
Sort
View
DEDS
2006
111views more  DEDS 2006»
15 years 3 months ago
Model Checking of Time Petri Nets Using the State Class Timed Automaton
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
Didier Lime, Olivier H. Roux
207
Voted
TII
2011
206views Education» more  TII 2011»
14 years 10 months ago
Timing-Failure Risk Assessment of UML Design Using Time Petri Net Bound Techniques
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...
Simona Bernardi, Javier Campos, José Merseg...
FORMATS
2005
Springer
15 years 9 months ago
Comparison of the Expressiveness of Timed Automata and Time Petri Nets
Béatrice Bérard, Franck Cassez, Serg...
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
15 years 7 months ago
Net Reductions for LTL Model-Checking
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
Javier Esparza, Claus Schröter