Journal
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS
Volume 6, Issue 3, Pages 460-471Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TII.2010.2050001
Keywords
Discrete-event systems; formal analysis; piecewise affine (PWA) systems
Categories
Funding
- Boston University [NSF CNS-0834260]
- University of Zaragoza [CICYT - FEDER DPI2006-15390]
- European Community [224498]
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [0834260] Funding Source: National Science Foundation
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available