Sciweavers

51 search results - page 3 / 11
» Model Checking Bounded Prioritized Time Petri Nets
Sort
View
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
13 years 10 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
APN
2007
Springer
13 years 12 months ago
A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
Kyller Costa Gorgônio, Jordi Cortadella, Fei...
APN
2006
Springer
13 years 9 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard
TII
2011
206views Education» more  TII 2011»
13 years 21 days 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...