Model checking bounded prioritized time Petri nets
Bernard Berthomieu,Florent Peres,François Vernadat +2 more
- pp 523-532
Reads0
Chats0
TLDR
It is shown that a slight extension of the "strong state classes" construction of [BV03] provides a convenient state space abstraction for these nets, preserving markings, states, and LTL formulas.Abstract:
In a companion paper [BPV06], we investigated the expressiveness of Time Petri Nets extended with Priorities and showed that it is very close to that Timed Automata, in terms of weak timed bisimilarity. As a continuation of this work we investigate here the applicability of the available state space abstractions for Bounded Time Petri Nets to Bounded Prioritized Time Petri Nets. We show in particular that a slight extension of the "strong state classes" construction of [BV03] provides a convenient state space abstraction for these nets, preserving markings, states, and LTL formulas. Interestingly, and conversely to Timed Automata, the construction proposed does not require to compute polyhedra differences.read more
Citations
More filters
Journal ArticleDOI
Essay on Semantics Definition in MDE - An Instrumented Approach for Model Verification
TL;DR: This work introduces a pragmatic and instrumented approach to define a translational semantics and to validate it against a reference operational semantics expressed by the DSL designer and applies this approach to the XSPEM process description language in order to verify process models.
Journal ArticleDOI
Design and Verification of Real-Life Processes With Application of Petri Nets
TL;DR: A new design flow of distributed logic controllers is introduced using interpreted Petri nets as modeling formalism and the usage of formal methods and double model checking ensure the correct functionality of the designed distributed logic controller.
Book ChapterDOI
Ladder Metamodeling and PLC Program Validation through Time Petri Nets
Darlam Fabio Bender,Benoit Combemale,Xavier Crégut,Jean-Marie Farines,Bernard Berthomieu,François Vernadat +5 more
TL;DR: This work proposes a model driven approach for formal verification of LD programs through model-checking, and provides a metamodel for a subset of the LD language that automatically generates behavioral properties over the LD models as LTL formulae which are checked over the generated TPN using the model-checkers available in the Tina toolkit.
Journal Article
Formal verification of embedded logic controller specification with computer deduction in temporal logic
TL;DR: The approach proposes to use a rule-based logical model presented at RTL-level that is suitable both for formal verification (model checking in the NuSMV tool) and for logical synthesis (using hardware description language VHDL).
Journal ArticleDOI
Prototyping of Concurrent Control Systems With Application of Petri Nets and Comparability Graphs
TL;DR: A novel prototyping technique for concurrent control systems described by interpreted Petri nets that allows implementing a concurrent control system using minimal number of sequential components, which requires polynomial time and can be applied to most of the considered cases.
References
More filters
Journal ArticleDOI
Modeling and verification of time dependent systems using time Petri nets
Bernard Berthomieu,Michel Diaz +1 more
TL;DR: An enumerative method is proposed in order to exhaustively validate the behavior of Merlin's time Petri net model and it is applied to the specification and verification of the alternating bit protocol as a simple illustrative example.
Journal ArticleDOI
The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
TL;DR: In addition to the graphic-editing facilities, the software tool Tina proposes the construction of a number of representations for the behaviour of Petrinets or Time Petri nets, which provide a finite symbolic representation of their behaviour in terms of state classes.
Book ChapterDOI
Minimization of Timed Transition Systems
TL;DR: These constraints require that for every clock i, the constraint ~ x i] = 0 or ~ xi] > c i holds at innnitely many regions along the path (here, c i is the largest constant in a constraint involving x in the enabling conditions of G) and can be used to handle progressiveness in the reduced region graphs.