Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics

@article{Knapik2010BoundedPV,
  title={Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics},
  author={Michal Knapik and Wojciech Penczek and Maciej Szreter and Agata P{\'o}lrola},
  journal={Fundam. Inform.},
  year={2010},
  volume={101},
  pages={9-27}
}
Bounded Model Checking (BMC) is an efficient technique appli cable to verification of temporal properties of (timed) distributed systems. In thi s paper we show for the first time how to apply BMC to parametric verification of time Petri nets with d iscrete-time semantics. The properties are expressed by formulas of the logic PRTECTL a parametric xtension of the existential fragment of Computation Tree Logic (CTL). 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Bounded parametr ic model checking for elementary net systems

  • M. Knapik, W. Penczek, M. Szreter
  • Proc. of Int. Workshop on Petri Nets and Software…
  • 2009
2 Excerpts

Ṕ ołrola. Advances in Verification of Time Petri Nets and Timed Automat a: A Temporal Logic Approach, volume 20 ofStudies in Computational Intelligence

  • A. W. Penczek
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…