Paper Info
Title
An Automated Framework for Formal Verification of Timed Continuous Petri Nets
Abstract
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.
Year
DOI
Venue
2010
10.1109/TII.2010.2050001
Industrial Informatics, IEEE Transactions
Keywords
Field
DocType
Petri nets,formal verification,mathematics computing,public domain software,software tools,temporal logic,ContPNs,LTL formula,LTL specification,PWA system,automated framework,formal verification,freely downloadable software tool,graphs,linear predicates,linear temporal logic,piecewise affine system,polyhedral partition,timed continuous Petri nets,Discrete-event systems,formal analysis,piecewise affine (PWA) systems
Affine transformation,Petri net,Computer science,Iterative method,Theoretical computer science,Linear temporal logic,Temporal logic,Piecewise,Formal verification,Computation
Journal
Volume
Issue
ISSN
6
3
1551-3203
Citations 
PageRank 
References 
20
1.15
20
Authors
4
Name
Order
Citations
PageRank
Marius Kloetzer147629.21
Cristian Mahulea216119.50
Calin Belta32197153.54
Silva, M.431636.61