By Topic

An Automated Framework for Formal Verification of Timed Continuous Petri Nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kloetzer, M. ; Dept. of Autom. Control & Appl. Inf., Tech. Univ. Gheorghe Asachi, Iasi, Romania ; Mahulea, C. ; Belta, C. ; Silva, M.

In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set of markings, construct a set of unreachable markings and (2) given a Linear Temporal Logic (LTL) formula over a set of linear predicates in the marking space, construct a set of initial states such that all trajectories originating there satisfy the LTL specification. The starting point for our approach is the observation that a ContPN system can be expressed as a Piecewise Affine (PWA) system with a polyhedral partition. We propose an iterative method for analysis of PWA systems from specifications given as LTL formulas over linear predicates. The computation mainly consists of polyhedral operations and searches on graphs, and the developed framework was implemented as a freely downloadable software tool. We present several illustrative numerical examples.

Published in:

Industrial Informatics, IEEE Transactions on  (Volume:6 ,  Issue: 3 )