Paper Info
Title
ON SAMPLING CONTINUOUS TIMED PETRI NETS: REACHABILITY "EQUIVALENCE" UNDER INFINITE SERVERS SEMANTICS
Abstract
This paper addresses a sampling problem for timed continuous Petri nets under infinite servers semantics. Different representations of the continuous Petri net system are given, the first two in terms of piecewise linear system and the third one, for the controlled continuous Petri nets systems, in terms of a particular linear constrained system with null dynamic matrix. The last one is used to obtain the discrete-time representation. An upper bound on sample period is given in order to preserve important information of timed continuous nets, in particular the positiveness of the markings. The reachability space of the sampled system in relation to autonomous continuous Petri nets is also studied.
Year
DOI
Venue
2006
10.3182/20060607-3-IT-3902.00011
IFAC Proceedings Volumes
Keywords
Field
DocType
Petri-nets,Continuous-time systems,Discrete-time systems
Discrete mathematics,Petri net,Upper and lower bounds,Computer science,Server,Stochastic Petri net,Reachability,Theoretical computer science,Process architecture,Equivalence (measure theory),Piecewise linear function
Conference
Volume
Issue
ISSN
39
5
1474-6670
Citations 
PageRank 
References 
5
0.54
3
Authors
5
Name
Order
Citations
PageRank
Cristian Mahulea116119.50
Alessandro Giu2131.18
Laura Recalde31228.42
Carla Seatzu470067.51
Silva, M.531636.61