scholarly journals Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches

Author(s):  
Didier Lime ◽  
Olivier H. Roux ◽  
Charlotte Seidner ◽  
Louis-Marie Traonouez
Author(s):  
Bernd Finkbeiner ◽  
Manuel Gieseking ◽  
Jesko Hecking-Harbusch ◽  
Ernst-Rüdiger Olderog
Keyword(s):  

2001 ◽  
Vol 8 (5) ◽  
Author(s):  
Thomas S. Hune ◽  
Judi Romijn ◽  
Mariëlle Stoelinga ◽  
Frits W. Vaandrager

<p>We present an extension of the model checker Uppaal capable<br /> of synthesizing linear parameter constraints for the correctness of<br />parametric timed automata. The symbolic representation of the (parametric)<br /> state-space is shown to be correct. A second contribution of this<br />paper is the identification of a subclass of parametric timed automata<br />(L/U automata), for which the emptiness problem is decidable, contrary<br />to the full class where it is know to be undecidable. Also we present a<br />number of lemmas enabling the verification effort to be reduced for L/U<br />automata in some cases. We illustrate our approach by deriving linear<br />parameter constraints for a number of well-known case studies from the<br />literature (exhibiting a flaw in a published paper).</p>


Author(s):  
Étienne André

AbstractReal-time systems are notoriously hard to verify due to nondeterminism, concurrency and timing constraints. When timing constants are uncertain (in early the design phase, or due to slight variations of the timing bounds), timed model checking techniques may not be satisfactory. In contrast, parametric timed model checking synthesizes timing values ensuring correctness. takes as input an extension of parametric timed automata (PTAs), a powerful formalism to formally verify critical real-time systems. extends PTAs with multi-rate clocks, global rational-valued variables and a set of additional useful features. We describe here the new features and algorithms offered by  3, that moved along the years from a simple prototype dedicated to robustness analysis to a standalone parametric model checker for timed systems.


Author(s):  
Zohra Sbaï ◽  
Rawand Guerfel

Web services composition (WSC) has an enormous potential for the organizations in the B2B area. In fact, different services collaborate through the exchange of messages to implement complex business processes. BPEL is one of the most used languages to develop such cooperation. However, it has been proved that its use is complex and can require some expertise in XML syntax. Even its graphical representation is not evident to handle. This is why the authors propose to model Web services using oWF-nets, a subclass of Petri nets, and then, to translate them to BPEL. Whilst, a WSC is with added value only if the involved services are compatible. So in this context, across the translation proposed the researchers develop a verification layer of the WSC compatibility. Hence, they propose a framework named D&A4WSC which allows to model the WSC by oWF-nets, to check their compatibility with the model checker NuSMV and to translate them if they are compatible in BPEL processes using the oWFN2BPEL compiler. D&A4WSC permits, furthermore, to formally analyze a BPEL process.


Author(s):  
Jia Feng Zhang ◽  
Olfa Mosbahi ◽  
Mohamed Khalgui ◽  
Atef Gharbi

Reconfigurable systems have received much attention from academia and industry because they are efficient, agile, and reasonably priced, and they are the trend of all future systems. The chapter focuses on dynamic automatic reconfigurations of Control Systems to be classically modeled by Petri nets. Several modeling and verification methods for such systems are shown and compared before the introduction of the research work on feasible dynamic reconfigurations and the implementation of manufacturing systems based on Petri nets. Three different reconfiguration scenarios can be applied at run-time to such systems: Addition/Removal of places, Addition/Removal/Update of transitions, or finally, the simple modification of the initial marking. Three formal modules are defined accordingly, which allow the reconfigurations of the system’s Petri nets model: the first module to dynamically change places of the model, the second to dynamically reconfigure transitions within a given subset of places, and the third to modify the initial markings of places. To check the correct behavior of this architecture according to user requirements, the model checker SESA is applied for the verification of CTL-based properties of the proposed modules and also of the system. The contribution is applied to a real-world Benchmark Production System.


Author(s):  
Elvio Gilberto Amparore ◽  
Susanna Donatelli ◽  
Francesco Gallà
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document