A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Polynomial-Time Many-One reductions for Petri nets
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
We apply to Petri net theory the technique of polynomialtime many-one reductions. We study boundedness, reachability, deadlock, liveness problems and some of their variations. ...
Finally, we give an upper bound on the boundedness for post self-modi ed nets: 2 O(size(N ) 2 log size(N )) . This improves a decidability result of Valk 18]. ...
Secondly, we establish a strong relation between Petri nets and Post Self-Modifying nets (PSM-nets) on the boundedness problem. ...
doi:10.1007/bfb0058039
fatcat:2oo5i65iwrchfbxmeuh77xnqf4
On observability in timed continuous Petri net systems
2004
First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we deal with T-timed fully continuous Petri Nets working under infinite servers semantics, what leads to (deterministic) piecewise linear differential systems. ...
For non Join-Free Petri Nets, conditions to compute suitable estimates will be established. ...
This difference is due to the fact that in Petri nets the PT-set depends only on the marking (and the net structure). ...
doi:10.1109/qest.2004.1348020
dblp:conf/qest/JulvezJRS04
fatcat:5sc5l7f7gre2lhvhd5k7g2djdi
The On-Line Diagnosis of Time Petri Nets
[chapter]
2013
Lecture notes in control and information sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We derive in this paper on-line algorithms for fault diagnosis of Time Petri Net (TPN) models. ...
We present two methods to derive the entire set of solutions of a characteristic system, one based on Extended Linear Complementarity Problem and the second one based on constraint propagation that exploits ...
A Time Petri Net (TPN) N θ = (P, T , F, I s ), consists of an (untimed) Petri Net N = (P, T , F ) (called the untimed support of N θ ) and the static time interval function I s : T →
Definition 7 A state ...
doi:10.1007/978-1-4471-4276-8_17
fatcat:4ftlmcx77fgfrjgjsob5lnqzf4
On performance bounds for interval time petri nets
2004
First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
In this paper we present the results obtained from a preliminary investigation on the applicability of bounding techniques of timed Petri nets to interval time Petri Nets. ...
Interval time Petri Nets are Petri nets in which time intervals are associated to transitions. ...
Bounds for special classes of interval Time Petri Nets In case of live and bounded systems similar techniques as the ones defined for Stochastic Petri Nets which make use of P-semiflows [5, 7, 6, 8] ...
doi:10.1109/qest.2004.1348019
dblp:conf/qest/BernardiC04
fatcat:j4kbmy4dzfbhzh4u254itatgfq
A Forward On-The-Fly Approach in Controller Synthesis of Time Petri Nets
[chapter]
2012
Petri Nets - Manufacturing and Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Time Petri nets 2.1. Definition and behavior A time Petri net [14] is a Petri net augmented with time intervals associated with transitions. ...
These abstractions are finite for all bounded time Petri nets. ...
doi:10.5772/47744
fatcat:qrsz6d6juzeb5m6zyykybgs5iq
On generation of state space for timed Petri nets
1988
Proceedings of the 1988 ACM sixteenth annual conference on Computer science - CSC '88
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
A b s t r a c t It is shown that the behavior of timed Petri nets with deterministic firing times (M-timed nets) can be described within one uniform formalism. ...
Moreover, for both classes of nets the state spaces are homogeneous semi-Markov chains, the stationary probabilities of states and many performance measures can thus be obtained by standard techniques ...
Some simple examples of D-timed and M-timed nets are given in section 7. On generation of state space for timed Petri nets 240 2. ...
doi:10.1145/322609.322648
dblp:conf/acm/Zuberek88
fatcat:ny4wrgflhzgq3nphdrmjl7a7by
On State Estimation of Timed Choice-Free Petri Nets
2011
IFAC Proceedings Volumes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present an online algorithm for state estimation of timed choice-free Petri nets. ...
This work extends the notion of basis markings defined for untimed Petri nets considering now the time information. ...
., nets with choices, and we show that the procedure is similar with the standard one of untimed Petri nets. ...
doi:10.3182/20110828-6-it-1002.01523
fatcat:xn4lmulom5emnamymf5raxj244
A multimedia synchronization model based on timed Petri net
1999
Journal of Computer Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In the present study, a multi-stage attack has been extracted and modeled with a timed Petri net, and then the results are compared with those of similar articles. ...
On the contrary, the local manager of transmission or distribution network may find this in conflict with his/her interests and may even take actions against it via cyber-attacks. ...
In this study, a timed Petri net was used to model a two-stage attack on the special protection service of the generation rejection. ...
doi:10.1007/bf02948516
fatcat:rt2hf2zbrjhl7ap2izgvlcxsoy
Optimal-Cost Reachability Analysis Based on Time Petri Nets
2018
2018 18th International Conference on Application of Concurrency to System Design (ACSD)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper shows that for some subclasses of cost time Petri nets, the optimalcost reachability problem can be solved more efficiently using a method based on the state classes, without resorting to linear ...
This paper investigates the optimal-cost reachability problem in the context of time Petri nets, where a rate cost is associated with each place. ...
COST TIME PETRI NETS
A. ...
doi:10.1109/acsd.2018.000-1
dblp:conf/acsd/BouchenebLRS18
fatcat:nb6aph3rfbat3lbmp3tyi636am
On the Computational Power of Timed Differentiable Petri Nets
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
In this work, we considerably strengthen this result by showing that Time Differentiable Petri Nets (TDPN) can simulate Turing machines. ...
These simulations are performed by nets whose dimension of associated ODEs is constant. ...
Definition 5 (Timed Differentiable Petri Nets). ...
doi:10.1007/11867340_17
fatcat:h3tiyqwbl5gxhdl6b7pgbvz5xu
Timing Constraints Support on Petri-Net Model for Healthcare System Design
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Thanks to Hierarchical Timed Predicate Petri-Net based conceptual framework, desirable properties such as deadlock free and safe as well as timing constraints satisfiability can be easily checked by designer ...
Hence, systems evolution through extension of the existing information technology infrastructure becomes one of the most challenging aspects of healthcare. ...
MODELING THE CONCEPTUAL FRAMEWORK BY HIERARCHICAL TIMED PREDICATE PETRI-NETS Petri-Nets are well-established process-modeling approach. ...
arXiv:1210.5374v1
fatcat:76yyec75jjac3f3sifttyuhl64
Adaptive time warp simulation of timed Petri nets
1999
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Time Warp (TW), although generally accepted as a potentially effective parallel and distributed simulation mechanism for timed Petri nets, can reveal deficiencies in certain model domains. ...
The sensitivity of the adaptive optimism control with respect to forecast accuracy and computational overhead is analyzed for very large Petri net simulation models executed with the TW protocol on the ...
ADAPTIVE LOGICAL PROCESS SIMULATION
Logical Process Simulation of Petri nets A logical process simulation (or distributed simulation) of timed Petri nets (TPNs) employs a set of LPs to execute event ...
doi:10.1109/32.761448
fatcat:6edbvxwbqbeddj5spxgdeicfia
On time-average limits in deterministic and stochastic petri nets
2013
Proceedings of the ACM/SPEC international conference on International conference on performance engineering - ICPE '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this poster paper, we study performance of systems modeled by deterministic and stochastic Petri nets (DSPN). ...
Further, we introduce a syntactical restriction on DSPN which preserves most of the modeling power yet guarantees existence of the long-run average. ...
For the sake of performance evaluation, Petri nets are turned into a continuous-time model as follows. ...
doi:10.1145/2479871.2479936
dblp:conf/wosp/BrazdilKKKR13
fatcat:io45al4kufhtxiftkmezoxpina
On-the-fly TCTL model checking for time Petri nets
2009
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show how to efficiently model check a subset of TCTL properties for the Time Petri Net model (TPN model), using the state class method. ...
A forward on-the-fly exploration is then applied on the resulting TPN state class space to verify a timed property. ...
The best known timed extensions are timed Petri nets proposed by Ramchandani [31] and time Petri nets proposed by Merlin and Farber [29] . ...
doi:10.1016/j.tcs.2009.06.019
fatcat:kf53upym5jdjzfvumomsf4jvae
Verification of Liveness Properties on Closed Timed-Arc Petri Nets
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To the best of our knowledge, the explicit methods have not yet been employed in the verification of liveness properties in Petri net models extended with time. ...
We present an algorithm for liveness analysis of closed Timed-Arc Petri Nets (TAPN) extended with weights, transport arcs, inhibitor arcs and age invariants and prove its correctness. ...
The first three papers present explicit methods for the model of timed automata, while the third one studies discretization for Time Petri Nets (TPN), a Petri net model that is substantially different ...
doi:10.1007/978-3-642-36046-6_8
fatcat:vy33myjv6vah5dsj5jyqgud75u
« Previous
Showing results 1 — 15 out of 76,092 results