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

Lime, Didier; Roux, Olivier H.; Seidner, Charlotte; Traonouez, Louis-Marie

doi:10.1007/978-3-642-00768-2_6

Cited by 97 publications

(55 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TINA [17] and Roméo [46] are frameworks for the verification of timed Petri nets. TINA provides an editor for graphically or textually described Petri nets, construction of reachability graphs, structural analysis, state/event LTL model checker and path analysis for time Petri nets.…”

Section: Related Workmentioning

confidence: 99%

Reo + mCRL2 : A framework for model-checking dataflow in service compositions

2012

View full text Add to dashboard Cite

Abstract. The paradigm of service-oriented computing revolutionized the field of software engineering. According to this paradigm, new systems are composed of existing stand-alone services to support complex cross-organizational business processes. Correct communication of these services is not possible without a proper coordination mechanism. The Reo coordination language is a channel-based modeling language that introduces various types of channels and their composition rules. By composing Reo channels, one can specify Reo connectors that realize arbitrary complex behavioral protocols. Several formalisms have been introduced to give semantics to Reo. In their most basic form, they reflect service synchronization and dataflow constraints imposed by connectors. To ensure that the composed system behaves as intended, we need a wide range of automated verification tools to assist service composition designers. In this paper, we present our framework for the verification of Reo using the mCRL2 toolset. We unify our previous work on mapping various semantic models for Reo, namely, constraint automata, timed constraint automata, coloring semantics and the newly developed action constraint automata, to the process algebraic specification language of mCRL2, address the correctness of this mapping, discuss tool support, and present a detailed example that illustrates the use of Reo empowered with mCRL2 for the analysis of dataflow in service-based process models.

show abstract

Section: Related Workmentioning

confidence: 99%

Reo + mCRL2 : A framework for model-checking dataflow in service compositions

2012

View full text Add to dashboard Cite

show abstract

“…The question is then to infer constraints on these parameters that ensure a minimum size of the input buffers. Even if this kind of question can be theoretically solved using symbolic model-checking (Lime et al, 2009), the computation complexity is high. The state of the art of the current existing tools did not allow us to automatically produce such symbolic constraints.…”

Section: Computing Optimum Initial Delaysmentioning

confidence: 99%

Some Synchronization Issues in OSPF Routing

Bouillard¹,

Jard²,

Junier³

2013

Proceedings of the 4th International Conference on Data Communication Networking, 10th International Conference on E-Business A

View full text Add to dashboard Cite

Abstract:A routing protocol such as OSPF has a cyclic behavior to regularly update its view of the network topology. Its behavior is divided into periods. Each period produces a flood of network information messages. We observe a regular activity in terms of messages exchanges and filling of receive buffers in routers. This article examines the consequences of possible overlap of activity between periods, leading to a buffer overflow. OSPF allows "out of sync" flows by considering an initial delay (phase). We study the optimum calculation of these offsets to reduce the load, while maintaining a short period to ensure a protocol reactive to topology changes. Such studies are conducted using a simulated Petri net model. A heuristic for determining initial delays is proposed. A core network in Germany serves as illustration.

show abstract

“…For example, Roméo [8] performs model checking for parametric TPNs with stopwatches, and synthesizes parameter valuations satisfying TCTL formulae. An extension of UPPAAL allows parametric model checking [3], although the model itself remains non-parametric.…”

Section: Related Workmentioning

confidence: 99%

Robustness Analysis for Scheduling Problems Using the Inverse Method

Fribourg

Soulat

Lesens³

et al. 2012

2012 19th International Symposium on Temporal Representation and Reasoning

View full text Add to dashboard Cite

Abstract-Given a Parametric Timed Automaton (PTA) A and a reference valuation for timings, the Inverse Method (IM) synthesizes a constraint around the reference valuation where A behaves in the same time-abstract manner. This provides us with a quantitative measure of robustness of the behavior of A around the reference valuation. We show in this paper how IM can be applied in a specific way to treat the robustness of scheduling systems. We also explain how to use the method in order to synthesize large zones of the timing parameter space where the system is guaranteed to be schedulable. We illustrate the method on several examples of the literature as well as a case study originating from an industrial design project.

show abstract

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

Cited by 97 publications

References 13 publications

Reo + mCRL2 : A framework for model-checking dataflow in service compositions

Reo + mCRL2 : A framework for model-checking dataflow in service compositions

Some Synchronization Issues in OSPF Routing

Robustness Analysis for Scheduling Problems Using the Inverse Method

Contact Info

Product

Resources

About