Extended time Petri nets (2405.09208v1)
Abstract: In many complex systems that can be modeled using Petri nets time can be a very important factor which should be taken into account during creation and analysis of the model. Time data can describe starting moments of some actions or their duration before their immediate effects start to influence some other areas of the modeled system. Places in a Petri net often describe static components of the system, but they can also describe states. Such a state can have time restrictions, for example, telling how long it can influence other elements in the model. Time values describing some system may be inconsistent or incomplete, which can cause problems during the creation of the model. In this paper, a new extension of time Petri nets is proposed, which allows the creation of models with different types of time data, which previously were possible to be properly used in separate types of well-known time Petri nets. The proposed new time Petri net solves this problem by integrating different aspects of already existing time Petri nets into one unified net.
- B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time petri nets. IEEE Transactions on Software Engineering, 17(3):259–273, 1991.
- B. Berthomieu and M. Menasche. An enumerative approach for analyzing time petri nets. In Proceedings IFIP, pages 41–46. Elsevier Science Publishers, 1983.
- From timed petri nets to timed lotos. In Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification, pages 395–408, Ottawa, Ontario, Canada, 1 1990.
- Symmetry reduction for time petri net state classes. Science of Computer Programming, 132, 09 2016.
- J. E. Coolahan and N. Roussopoulos. Timing requirements for time-driven systems using augmented petri nets. IEEE Transactions on Software Engineering, 9(5):603–616, 1983.
- Verification of timed-arc petri nets. In SOFSEM 2011: Theory and Practice of Computer Science, pages 46–72, Berlin, Heidelberg, 2011. Springer Berlin Heidelberg.
- P. M. Merlin. A Study of the Recoverability of Computing Systems. University of California, Irvine, 1974.
- Dependent shrink of transitions for calculating firing frequencies in signaling pathway petri net model. Algorithms, 10(1), 2017.
- T. Murata. Petri nets: properties, analysis and aplications. Proceedings of IEEE, 90:541–580, 1989.
- C. A. Petri. Communication with Automata (in German). PhD thesis, Schriften des Instituts fur Instrumentelle Mathematik, Bonn, 1962.
- L. Popova-Zeugmann. Petri nets with time restrictions. Systems Analysis Modelling Simulation, 13:13–20, 1993.
- L. Popova-Zeugmann. Time and Petri Nets. Springer, Berlin, 2013.
- L. Popova-Zeugmann and E. Pelz. Algebraical characterisation of interval-timed petri nets with discrete delays. Fundamenta Informaticae, 120:341–357, 2021.
- M. Radom and P. Formanowicz. Algorithmic aspects of extended time petri nets. In Andrzej Świerniak and Jolanta Krystek, editors, Automatyzacja Procesów Dyskretnych (in Polish), volume 2, pages 91–102. Wydawnictwo Politechniki Śląskiej, Gliwice, Poland, 2022.
- C. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri nets. PhD Thesis. Massachusetts Institute of Technology, 1974.
- J. Sifakis. Performance evaluation of systems using nets. In W. Brauer, editor, Net Theory and Applications, pages 307–319, Berlin, Heidelberg, 1980. Springer Berlin Heidelberg.
- Comparing petri net-based models of biological systems using holmes. Bioinformatics, 38(19):4652–4653, 2022.
- J.-T. Wegener and L. Popova-Zeugmann. Petri nets with time windows: A comparison to classical petri nets. Fundam. Inform., 93:337–352, 2009.
- On determining firing delay time of transitions for petri net based signaling pathways by introducing stochastic decision rules. In silico biology, 10:49–66, 2010.
- Time petri nets with dynamic firing dates: Semantics and applications. In 12th International Conference, pages 85–99, Florence, Italy, 2014. FORMATS.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.