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.
Filters
The Internet of Things Enabled Shop Floor Scheduling and Process Control Method Based on Petri Nets
2019
IEEE Access
Preserved Fulltext
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. ...
INDEX TERMS Internet of Things enabled shop floor, dynamic scheduling, ant colony optimization, Petri nets, XML, RFID. ...
Thus, timed Petri nets are an ideal tool for modeling the FJSP [36] . ...
doi:10.1109/access.2019.2900117
fatcat:oeazjyos5ba7dewbuwgx3i7bie
Factored Planning: From Automata to Petri Nets
2013
2013 13th International Conference on Application of Concurrency to System Design
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 change the representation of components to safe Petri nets. ...
This allows one to use cheap structural operations like transition contractions to reduce the size of the Petri net, before its state space is generated, which often leads to substantial savings compared ...
This shows that an instance of Algorithm 1 can be used for solving factored planning problems represented as products of Petri nets. ...
doi:10.1109/acsd.2013.16
dblp:conf/acsd/JezequelFK13
fatcat:dlgbq2x7ung7hjsr2ewoa7s4g4
Introducing PetriRL: An Innovative Framework for JSSP Resolution Integrating Petri nets and Event-based Reinforcement Learning
[article]
2024
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 2024; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this research, we introduce an innovative framework for solving job shop scheduling problems (JSSP). ...
The Petri net, with its controlling capacities, also governs the automated components of the process, allowing the agent to focus on critical decision-making, particularly resource allocation. ...
We introduce PetriRL, an innovative framework that leverages Petri nets and actor-critic-based reinforcement learning to address job-shop scheduling problems. ...
arXiv:2402.00046v1
fatcat:m5fmk3rydjgaveph5hcevvwbda
Faster Simulation of (Coloured) Petri Nets Using Parallel Computing
[chapter]
2017
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 2020; you can also visit the original URL.
The file type is application/pdf.
We design an algorithm to do so and assess in particular its correctness and completeness through its formal modelling as a Petri net whose state space is analysed. ...
We also present a benchmark of a prototype implementation that clearly shows how our algorithm effectively accelerates fast simulation, in particular in the case of large concurrent coloured Petri nets ...
Acknowledgements We warmly thank Camille Coti (lipn) for her help in understanding our hardware and how to exploit it correctly for our benchmark. ...
doi:10.1007/978-3-319-57861-3_4
fatcat:qakm2vkubzbw7gxapms5ljz5pe
An SMT-based approach to fair termination analysis
2015
2015 Formal Methods in Computer-Aided Design (FMCAD)
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.
In a former paper (An SMT-based Approach to Coverability Analysis, CAV14) we have revisited a constraint approach to coverability based on classical Petri net analysis techniques and implemented it on ...
Algorithms for the coverability problem have been successfully applied to safety checking for concurrent programs. ...
ACKNOWLEDGMENTS We thank Filip Niksic, Corneliu Popeea, and Karsten Wolf for kindly providing examples for our experimental evaluation. ...
doi:10.1109/fmcad.2015.7542252
fatcat:r6hcszp54jauzm62jxadawxelm
Schedule Optimization based on Coloured Petri Nets and Local Search
2012
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.
AbstractThe contribution deals with simulation-optimization of schedules that are modelled by simple Coloured Petri nets (CPNs). ...
It is shown how a combination of CPN representations with predefined transition sequence conflict resolution strategy can be used to optimize schedules by standard local search optimization algorithms. ...
ACKNOWLEDGEMENTS The presented work has been partially performed within Competence Centre for Advanced Control Technologies, an operation co-financed by the European Union, European Regional Development ...
doi:10.3182/20120215-3-at-3016.00062
fatcat:6qlrug5m5zhg5ditqzwm4hilge
Scheduling Analysis of FMS Using the Unfolding Time Petri Nets
[chapter]
2008
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 2019; you can also visit the original URL.
The file type is application/pdf.
(Theorem. 3.1) Let N be a Time Petri net and Ns be a set of Time Petri net slices that is produced by the slice algorithm. ...
Modeling of UTPN An important sub-class (sliced net) of Time Petri nets is a net in which has an independent control flow and for which all weights associated to arcs are equal to one. ...
Petri Net, Theory and Applications Although many other models of concurrent and distributed systems have been de-veloped since the introduction in 1964 Petri nets are still an essential model for concurrent ...
doi:10.5772/5322
fatcat:k3tlg6jlz5aenc2asirtb5vrt4
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
2005
Proceedings of the 5th ACM international conference on Embedded software - EMSOFT '05
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.
Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an intermediate model of the system. ...
Our approach prove unschedulability typically within a second for Petri nets generated from industrial JPEG and MPEG codecs, while the scheduler fails to terminate within 24 hours. ...
Then a heuristic algorithm searches the reachability tree of the Petri net for a schedule. If it succeeds, the generated schedule is transformed back to a sequential program. ...
doi:10.1145/1086228.1086231
dblp:conf/emsoft/LiuKWS05
fatcat:6rl4slmgjbbmlhpif27bnmfpxu
Special Issue: Combined Scheduling and Control
2018
Processes
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.
Dynamical Scheduling and Robust Control in Uncertain Environments with Petri Nets for DESs [2]. ...
This paper is about the incremental computation of control sequences for discrete event systems in uncertain environments through implementation of timed Petri nets. ...
Evidence that Model Predictive Control (MPC) with an unmeasured disturbance model is the most adequate control algorithm for the studied system is presented. ...
doi:10.3390/pr6030024
fatcat:4fwc5bquwnaqbjchwcwh46huhe
Model Checking Data Flows in Concurrent Network Updates
[chapter]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2004.10413v1 fatcat:sy3tb4v4dzertojq6ngstndcneOther Versions
Bounded synthesis automatically generates an implementation for the specification of the distributed system if one exists. ...
For Petri games, experimental results show that our implementation using true concurrency outperforms the implementation based on checking all interleavings. ...
The paper is structured as follows: In Section 2, we give an intuitive introduction to Petri games and the benefits of true concurrent scheduling for bounded synthesis for Petri games. ...
doi:10.1007/978-3-030-31784-3_30
fatcat:3muylgblcvcn3lkyedh5dl7mpq
Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net
2012
Journal of Applied Mathematics
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 the proposed method, the flexible job-shop scheduling problem systems was modeled by color Petri net and CPN tool and then a scheduled job was programmed by GSA algorithm. ...
In this paper, new algorithm were proposed for flexible job-shop scheduling problem systems (FJSSP-GSPN) that is based on gravitational search algorithm (GSA). ...
In this paper, FJSSP-GSPN algorithm based on gravitational local search and time Petri net is proposed for scheduling time optimization in FJSSP. ...
doi:10.1155/2012/651310
fatcat:rr637ig4qvgw7hhpt4kbfvp7ru
Using unfoldings in automated testing of multithreaded programs
2012
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering - ASE 2012
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.
For testing multithreaded programs we present a new approach that combines dynamic symbolic execution with unfoldings, a method originally developed for Petri nets but also applied to many other models ...
We provide an experimental comparison of our new approach with existing algorithms combining dynamic symbolic execution and partial-order reductions and show that the new algorithm can explore the reachable ...
However, these algorithms are designed for arbitrary Petri nets in mind and are computationally expensive. ...
doi:10.1145/2351676.2351698
dblp:conf/kbse/KahkonenSH12
fatcat:s4kjqxzcp5elvpqhy7u4go3bbi
Learning Scheduling Models from Event Data
2019
International Conference on Automated Planning and Scheduling
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.
We introduce a novel methodology that combines process mining, timed Petri nets (TPNs), and constraint programming (CP). ...
To demonstrate the value of the methodology we conduct experiments in which we learn and solve scheduling models from two types of data: logs generated from job-shop scheduling benchmarks and real-world ...
Activity-Resource Petri Nets Our approach requires a process mining algorithm that learns a timed Petri net. ...
dblp:conf/aips/SenderovichBB19
fatcat:gb7d63wmebgilnep7yrqerumjy
Automated Petri-Net Modelling for Batch Production Scheduling
[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 2018; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements The work was done in the frame of the Competence Centre for Advanced Control Technologies. ...
Petri net based derivation of optimal or sub-optimal schedules To derive a feasible schedule, the obtained Petri net model can be simulated by an appropriate simulation algorithm. ...
Petri-Net Modelling for Batch Production Scheduling
Automated Petri-Net Modelling for Batch Production Scheduling
Petri Nets -Manufacturing and Computer Science Automated Petri-Net Modelling ...
doi:10.5772/48467
fatcat:lxktbbjlkncapegu3pf2cpiafm
Lightweight State Capturing for Automated Testing of Multithreaded Programs
[chapter]
2014
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 2015; you can also visit the original URL.
The file type is application/pdf.
Our approach is based on modeling states that are observed during the test executions as a Petri net. This model is then used to determine if some execution paths lead to an already explored state. ...
Lightweight State Capturing for Automated Testing ...
A Petri net is a tuple Σ = (P, T, F, M 0 ), where (P, T, F ) is a net and M 0 is an initial marking of (P, T, F ). ...
doi:10.1007/978-3-319-09099-3_15
fatcat:24sh4gq4ene7rmsouydwqh7rea
« Previous
Showing results 1 — 15 out of 2,162 results