A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Marking optimization of stochastic timed event graphs using IPA
1996
Discrete event dynamic systems
Preserved Fulltext
Marking optimization of stochastic timed event graphs using IPA. [Research Report] RR-1856, INRIA. 1993, pp.28. <inria-00074816> To cite this version: ...
Marking optimization of stochastic timed event graphs using IPA Jean-Marie Proth, Nathalie Sauer, Yorai Wardi, Xiaolan Xie Jean-Marie Proth, Nathalie Sauer, Yorai Wardi, Xiaolan Xie. ...
doi:10.1007/bf01797153
fatcat:dtioyyxvnjb7fadyrtr7dbce5u
Marking optimization of stochastic timed event graphs using IPA
Proceedings of 32nd IEEE Conference on Decision and Control
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 2018; you can also visit the original URL.
The file type is application/pdf.
Marking optimization of stochastic timed event graphs using IPA. [Research Report] RR-1856, INRIA. 1993, pp.28. <inria-00074816> To cite this version: ...
Marking optimization of stochastic timed event graphs using IPA Jean-Marie Proth, Nathalie Sauer, Yorai Wardi, Xiaolan Xie Jean-Marie Proth, Nathalie Sauer, Yorai Wardi, Xiaolan Xie. ...
doi:10.1109/cdc.1993.325061
fatcat:nynftgfa5rhonmjtxqqrpdr7au
Page 5390 of Mathematical Reviews Vol. , Issue 94i
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “This paper addresses the performance evaluation and marking optimization of stochastic timed event graphs. ...
{For the entire collection see MR 94f:68004.}
94i:68225 68Q90 Sauer, Nathalie; Xie, Xiao-Lan Marking optimization of stochastic timed event graphs. ...
Page 3333 of Mathematical Reviews Vol. , Issue 93f
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This paper provides bounds on cycle times for the sub-class of stochastic Petri nets known as timed event graphs, or marked graphs. ...
- able which is stochastically greater than random variables which can be derived from the firing times of the event graph. ...
Optimizing Searches via Rare Events
2002
Physical Review Letters
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We study the different types of rare events which occur in such out-of-equilibrium stochastic processes and we show how they cooperate in determining the final distribution of running times. ...
As a byproduct of our analysis we show how search algorithms are optimized by random restarts. ...
We study the different types of rare events which occur in such out-of-equilibrium stochastic processes and we show how they cooperate in determining the final distribution of running times. ...
doi:10.1103/physrevlett.88.178701
pmid:12005788
fatcat:eubbohkxcbb2nccuc46lrbtol4
Conformance Checking Over Stochastically Known Logs
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
Then, we search for an optimal alignment over the reachability graph of the stochastic synchronous product for finding an optimal alignment between a model and a stochastic process observation. ...
of events in a log. ...
Then, we search for an optimal alignment over the reachability graph of the stochastic synchronous product to find an optimal alignment. The main contributions of this work are: 1. ...
arXiv:2203.07507v1
fatcat:maobdywgwvbrtldlx7mi3ot3ie
On analyzing the vulnerabilities of a railway network with Petri nets
2017
Transportation Research Procedia
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.
derived from the reachability graph of the GSPN. ...
derived from the reachability graph of the GSPN. ...
Giving the reachability graph and being > the generic marking of , the set of markings of the graph in which the failure event / is active is defined as the number of markings of the reachability graph ...
doi:10.1016/j.trpro.2017.12.144
fatcat:4rvoaynem5ashkmuimzi6fvcxy
Improving Business Process Efficiency for Supply Chain Finance: Empirical Analysis and Optimization Based on Stochastic Petri Net
2020
IEEE Access
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.
By integrating the Petri Net and dependency graph, several key places and transitions in the Petri Net of SCF processes are identified for further optimization. ...
Efficient business process is important to the operations of supply chain finance (SCF). Many deficiencies exist in the processes of SCF such as complicated workflows and high time-consuming steps. ...
The reachable marking graph of Petri Net ...
doi:10.1109/access.2020.2995851
fatcat:oi7rrmdmgzazra2zw53blinibe
The Internet of Things Enabled Shop Floor Scheduling and Process Control Method Based on Petri Nets
2019
IEEE Access
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 shop floor scheduling/rescheduling method based on Petri net and ant colony optimization (PN-ACO) is proposed given an abnormal event represented by machine breakdown. ...
Shop floor scheduling requires consideration of the dynamic, time-varying, and unpredictable natures of the manufacturing environment. ...
SCHEDULING METHOD OF THE FJSP Theoretically, an optimal schedule can be obtained by generating a reachability graph and finding the optimal path from the initial marking to the goal marking. ...
doi:10.1109/access.2019.2900117
fatcat:oeazjyos5ba7dewbuwgx3i7bie
Distributed workflow based approach for eliminating redundancy in virtual enterprising
2011
Journal of Supercomputing
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.
The existence of redundancy is a serious problem in virtual enterprise in which a number of collaborating enterprises join together to manufacture and sell a class of product for a time-limited period. ...
This paper also presents a working example as a proof of concept. ...
Assigning the dynamics of a Petri net in the Main Simulation File (MSF): • The initial markings on the places, and possibly • The firing times of the transitions. ...
doi:10.1007/s11227-010-0544-6
fatcat:6gqhaanmafa6rn2sgjjykr2tbi
HYPENS: A Matlab Tool for Timed Discrete, Continuous and Hybrid Petri Nets
[chapter]
2008
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.
It has been developed in Matlab to allow designer and user to take advantage of several functions and structures already defined in Matlab, such as optimization routines, stochastic functions, matrices ...
HYPENS is an open source tool to simulate timed discrete, continuous and hybrid Petri nets. ...
-graph ∈ {0, 1}: when set to 1 the evolution graph is printed on screen.-marking plot: is a vector used to plot the marking evolution of selected places in separate figures. ...
doi:10.1007/978-3-540-68746-7_28
fatcat:hdcjxurdhbhfhiduk6pddgzewa
Probabilistic Trace Alignment
[article]
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, for the first time, we provide a conformance checking approach based on trace alignments using stochastic Workflow nets. ...
to a stochastic process model instead of finding trace alignments. ...
Given an initial marking M over N , the reachability graph of (N, M ) is a graph (M, E) with nodes M and T -labelled edges E, where nodes M are all the reachable markings from M (M included), and where ...
arXiv:2107.03997v1
fatcat:qdqwkip6uzeijn5rjz7f5bkwf4
A GRAPH BASED MODEL FOR THE DETECTION OF TIDAL CHANNELS USING MARKED POINT PROCESSES
2015
The International Archives of the Photogrammetry, Remote Sensing and Spatial 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 2017; you can also visit the original URL.
The file type is application/pdf.
The graph is iteratively generated and fitted to the data using stochastic optimization based on a Reversible Jump Markov Chain Monte Carlo (RJMCMC) sampler and simulated annealing. ...
We present the method of our graph based model and show results for lidar data, which serve of a proof of concept of our approach. ...
Hinz doi:10.5194/isprsarchives-XL-3-W3-115-2015
ACKNOWLEDGEMENTS We would like to thank the Ministry of Environment, Energy, and Climate Protection as well as the Ministry of Science and Culture of Lower ...
doi:10.5194/isprsarchives-xl-3-w3-115-2015
fatcat:64bmsd4xwrez3fq2y76mnsj7di
Exact and Efficient Algorithm to Discover Extreme Stochastic Events in Wind Generation over Transmission Power Grids
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Stepanov, Predicting Failures in Power Grids: The Case of Static Overloads, IEEE Smart Grid 2011] and suggest a new algorithm discovering most probable extreme stochastic events in static power grids associated ...
We illustrate the algorithm's ability to discover problematic extreme events on the example of the IEEE RTS-96 model of transmission with additions of 10%, 20% and 30% of renewable generation. ...
This ranking is useful to discover the list of extreme stochastic events. ...
arXiv:1104.0183v2
fatcat:aymgtqasuffane4gdcujawzym4
Parameter Perturbation Analysis through Stochastic Petri Nets: Application to an Inventory System
[chapter]
2010
Advances in Petri Net Theory and Applications
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.
The reachability graph of an SPN is identical to that of the underlying untimed PN. The nodes of the graph represent all markings reachable from the initial marking. ...
In a stochastic Petri net, the time delays associated with certain transitions are random variables and the underlying marking process (state evolution process) of the net is a stochastic process. ...
The world is full of events which cause, end or affect other events. The study of these events, from a system point of view, is very important. ...
doi:10.5772/10296
fatcat:qq5so6dxnnffxgr3ryo62ur4iy
« Previous
Showing results 1 — 15 out of 32,476 results