Paper Info
Title
Efficient Method for Checking the Existence of a Safety/ Reachability Controller for Time Petri Nets
Abstract
This paper considers the Time Petri Nets (the TPN model) with controllable and uncontrollable transitions. It proposes a completely forward on-the-fly algorithm for checking the existence of a safety / reachability controller. Given a TPN and a safety / reachability property, the control consists of restricting the firing intervals of controllable transitions so that to satisfy the property of interest. Our approach, based on the TPN state class graph method, computes on-the-fly the reachable state classes of the TPN while collecting progressively subclasses to be avoided so that to satisfy the property. Three levels of control can be carried out: a static control (independent of states and markings), a marking depending control, or a state depending control. Our approach does not need to compute controllable predecessors and then split state classes as it is the case for other approaches based on exploration of state space of the system (backward and forward approaches).
Year
DOI
Venue
2010
10.1109/ACSD.2010.23
Application of Concurrency to System Design
Keywords
Field
DocType
Petri nets,control system synthesis,game theory,controller synthesis,graph method,marking depending control,on-the-fly algorithm,reachability controller,safety controller,state classes,state depending control,static control,time Petri nets,controller synthesis,on-the-fly algorithm,reachability properties,safety properties,time Petri nets
Graph,Control theory,Petri net,Semiconductor device modeling,Computer science,Theoretical computer science,Reachability,Real-time computing,Game theory,Aerospace electronics,State space
Conference
ISSN
ISBN
Citations 
1550-4808 E-ISBN : 978-1-4244-7267-3
978-1-4244-7267-3
2
PageRank 
References 
Authors
0.40
6
2
Name
Order
Citations
PageRank
Parisa Heidari1153.64
Hanifa Boucheneb224127.72