Parametric model-checking of stopwatch Petri nets
From MaRDI portal
Publication:4929342
zbMATH Open1217.68140MaRDI QIDQ4929342FDOQ4929342
Authors: Louis-Marie Traonouez, Didier Lime, Olivier H. Roux 
Publication date: 22 September 2010
Full work available at URL: http://www.jucs.org/jucs_15_17/parametric_model_checking_of
Recommendations
- Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
- Cost problems for parametric time Petri nets
- Symbolic unfolding of parametric stopwatch Petri nets
- Bounded parametric verification for distributed time Petri nets with discrete-time semantics
- scientific article; zbMATH DE number 6708300
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (22)
- Expressiveness of Petri Nets with Stopwatches. Dense-time Part
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
- Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
- On-the-fly \(TCTL\) model checking for time Petri nets
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
- Parametric model checking with VerICS
- Parametric schedulability analysis of a launcher flight control system under reactivity constraints
- Parametric Language Analysis of the Class of Stop-and-Wait Protocols
- Formalising concurrent UML state machines using coloured Petri nets
- Parametric verification: an introduction
- A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
- Post and pre-initialized stopwatch Petri nets: formal semantics and state space computation
- Bounded parametric verification for distributed time Petri nets with discrete-time semantics
- Parameter synthesis for hierarchical concurrent real-time systems
- Cost problems for parametric time Petri nets
- Title not available (Why is that?)
- FAST verification of the class of stop-and-wait protocols modelled by coloured Petri nets
- Symbolic unfolding of parametric stopwatch Petri nets
- Symbolic unfolding of parametric stopwatch Petri nets
- Shrinking of time Petri nets
- Symbolic analysis and parameter synthesis for time Petri nets using Maude and SMT solving
- Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets
Uses Software
This page was built for publication: Parametric model-checking of stopwatch Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929342)
