Guanjun Liu
Skip Abstract Section
Abstract
The correctness of a time-critical system is closely related to the time of responding and performing every event. Our motivation example, alternating bit protocol, and application example, multi-track level crossing with sensors, both demonstrate that some nondeterministic behaviours can take place if the time associated with events is configured inappropriately or some concurrent events are controlled imperfectly in an overlapping period. These nondeterministic behaviours decrease the reliability and/or safety of a time-critical system. Therefore, it is valuable to formalise and check (non)determinacy.
Time Petri Nets (TPN) in which the firing of every event is limited to a fix time interval are used to model time-critical systems in this article. We proposes a novel notion for TPN named time-soundness. It guarantees that the system always owns deterministic behaviours after any event is performed no matter when the event is performed. We utilise the notion of bisimulation to prove that the time-soundness can guarantee the behavioural determinacy. We propose an algorithm to check time-soundness, develop the related tool, and do experiments to show the usefulness and effectiveness of our notion and method.
- W. M. P. van der Aalst. 2000. Workflow verification: Finding control-flow errors using Petri-net-based techniques. In Business Process Management. Springer, 161--183. Google Scholar
Digital Library
- W. M. P. van der Aalst, K. M. Van Hee, A. H. M. Ter Hofstede, N. Sidorova, H. M. W. Verbeek, M. Voorhoeve, and M. T. Wynn. 2011. Soundness of workflow nets: Classification, decidability, and analysis. Formal Aspects Comput. 23, 3 (2011), 333--363. Google ScholarDigital Library
- Jorg Peter Bachmann and Louchka Popova-Zeugmann. 2010. Time-independent liveness in time Petri nets. Fundamenta Informaticae 102, 1 (2010), 1--17. Google ScholarDigital Library
- Kamel Barkaoui, J. M. Couvreur, and C. Dutheillet. 1995. On liveness in extended non self-controlling nets. In Proceedings of the 16th International Conference Application and Theory of Petri Nets. 25--44. Google ScholarDigital Library
- Johan Bengtsson and Wang Yi. 2004. Timed automata: Semantics, algorithms and tools. In Lectures on Concurrency and Petri Nets. Springer, 87--124.Google Scholar
- S. Bernardi, J. Campos, and J. Merseguer. 2011. Timing-failure risk assessment of UML design using time Petri net bound techniques. IEEE Trans. Industr. Informat. 7, 1 (2011), 90--104.Google ScholarCross Ref
- B. Berthomieu and M. Diaz. 1991. Modeling and verification of time-dependent systems using time Petri nets. IEEE Trans. Softw. Eng. 17, 3 (1991), 259--273. Google ScholarDigital Library
- Bernard Berthomieu, Miguel Menasche, Centre National, and Recherche Scienti. 1983. An enumerative approach for analyzing time Petri nets. In Proceedings of the International Federation for Information Processing (IFIP’83). 41--46.Google Scholar
- Bernard Berthomieu and François Vernadat. 2003. State class constructions for branching analysis of time Petri nets. In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03). 442--457. Google ScholarDigital Library
- Giacomo Bucci and Enrico Vicario. 1995. Compositional validation of time-critical systems using communicating time Petri nets. IEEE Trans. Softw. Eng. 21, 12 (1995), 969--992. Google ScholarDigital Library
- Laura Carnevali, Lorenzo Ridi, and Enrico Vicario. 2011. Putting preemptive time Petri nets to work in a v-model SW life cycle. IEEE Trans. Softw. Eng. 37, 6 (2011), 826--844. Google ScholarDigital Library
- Karlis Cerans. 1992. Decidability of bisimulation equivalences for parallel timer processes. In Proceedings of the International Workshop on Computer Aided Verification. 302--315. Google ScholarDigital Library
- Felipe Corso, Yeison Camargo, and Leonardo Ramirez. 2014. Wireless sensor system according to the concept of Iot--Internet of Things. In Proceedings of the 2014 International Conference on Computational Science and Computational Intelligence (CSCI’14). IEEE, Los Alamitos, CA, 52--58. Google ScholarDigital Library
- Maryam Davoudpour, Alireza Sadeghian, and Hossein Rahnama. 2015. “CANthings” (Context aware network for the design of connected things) service modeling based on timed CPN. In Proceedings of the 2015 IEEE International Conference on Semantic Computing (ICSC’15). IEEE, Los Alamitos, CA, 127--130.Google ScholarCross Ref
- Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, and Wang Yi. 2008. Timed automata patterns. IEEE Trans. Softw. Eng. 34, 6 (Nov. 2008), 844--859. Google ScholarDigital Library
- Yuyue Du, Changjun Jiang, and Mengchu Zhou. 2007. Modeling and analysis of real-time cooperative systems using Petri nets. IEEE Trans. Syst. Man Cybernet., Part A 37, 5 (2007), 643--654. Google ScholarDigital Library
- Yanhua Du, Wei Tan, and Meng Chu Zhou. 2014. Timed compatibility analysis of web service composition: A modular approach based on Petri nets. IEEE Trans. Automat. Sci. Eng. 11, 2 (2014), 594--606.Google ScholarCross Ref
- Pedro Foyo and Jose Reinaldo Silva. 2011. Some issues in real-time systems verification using time Petri nets. J. Brazil. Soc. Mech. Sci. Eng. 33, 4 (2011), 467--474.Google ScholarCross Ref
- Guillaume Gardey, Olivier H. Roux, and Olivier F. Roux. 2003. Using zone graph method for computing the state space of a time Petri net. In Proceedings of the 1st International Workshop on Formal Modeling and Analysis of Timed Systems. 246--259.Google Scholar
- Mohamed Ghazel and Baisi Liu. 2016. A customizable benchmark to deal with fault diagnosis issues in DES. In Proceedings of the International Workshop on Discrete Event Systems. 177--182.Google ScholarCross Ref
- Rachid Hadjidj and Hanifa Boucheneb. 2008. Improving state class constructions for CTL* model checking of time Petri nets. Int. J. Softw. Tools Technol. Transfer 10, 2 (2008), 167--184.Google ScholarDigital Library
- Rachid Hadjidj and Hanifa Boucheneb. 2010. Efficient reachability analysis for time Petri nets. IEEE Trans. Comput. 60, 8 (2010), 1085--1099. Google ScholarDigital Library
- John E. Hopcroft and Jeffrey D. Ullman. 1990. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Longman, Boston, MA. Google ScholarDigital Library
- Neil D. Jones, Lawrence H. Landweber, and Y. Edmund Lien. 1977. Complexity of some problems in Petri nets. Theoret. Comput. Sci. 4, 3 (1977), 277--299.Google ScholarCross Ref
- Nancy G. Leveson and Janice L. Stolzy. 1987. Safety analysis using Petri nets. IEEE Trans. Softw. Eng. SE-13, 3 (1987), 386--397. Google ScholarDigital Library
- Didier Lime and Olivier H. Roux. 2006. Model checking of time Petri nets using the state class timed automaton. Discrete Event Dynam. Syst. 16, 2 (2006), 179--205. Google ScholarDigital Library
- Sea Ling and Heinz Schmidt. 2000. Time Petri nets for workflow modelling and analysis. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics. 3039--3044.Google Scholar
- Guanjun Liu. 2014. Some complexity results for the soundness problem of workflow nets. IEEE Trans. Services Comput. 7, 7 (2014), 322--328.Google ScholarCross Ref
- Guanjun Liu and Changjun Jiang. 2016. Behavioral equivalence of security-oriented interactive systems. IEICE Trans. Info. Syst. E99-D, 8 (2016), 1--8.Google Scholar
- Guanjun Liu, Changjun Jiang, Meng Chu Zhou, and Peng Cheng Xiong. 2013. Interactive Petri nets. IEEE Trans. Syst. Man Cybernet. Syst. 43, 2 (2013), 291--302.Google ScholarCross Ref
- GuanJun Liu, Wolfgang Reisig, Changjun Jiang, and Mengchu Zhou. 2016. A branching-process-based method to check soundness of workflow systems. IEEE Access 4 (2016), 4104--4118.Google ScholarCross Ref
- Guanjun Liu, Jun Sun, Yang Liu, and Jinsong Dong. 2012. Complexity of the soundness problem of bounded workflow nets. In Proceedings of the International Conference on Application and Theory of Petri Nets. 92--107. Google ScholarDigital Library
- José Antonio Mateo, Valentín Valero Ruiz, Hermenegilda Macià, and Gregorio Díaz. 2014. A coloured Petri net approach to model and analyse stateful workflows based on WS-BPEL and WSRF. In Proceedings of the Conference on Software Engineering and Formal Methods (SEFM’14). 389--404.Google Scholar
- José Antonio Mateo, Jiří Srba, and Mathias Grund Sørensen. 2014. Soundness of timed-arc workflow nets. In Proceedings of the 2014 International Conference on Application and Theory of Petri Nets and Concurrency (ICATPN’14). 51--70.Google ScholarCross Ref
- Philip Meir Merlin. 1975. A Study of the Recoverability of Computer System. Ph.D. Dissertation, Department of Computer Science, University of Califomia, Irvine.Google Scholar
- P. M. Merlin and D. J. Faber. 1976. Recoverability of communication protocols—implications of a theoretical study. IEEE Trans. Commun. 24, 9 (1976), 1036--1043.Google ScholarCross Ref
- Robin Milner. 1999. Communicating and Mobile Systems: The Pi-Calculus. Cambridge University Press, New York, NY. Google ScholarDigital Library
- Tadao Murata. 1989. Petri nets: Properties, analysis, and applications. Proc. IEEE 77, 4 (1989), 541--580.Google ScholarCross Ref
- Li Pan, Zhi Jun Ding, and Meng Chu Zhou. 2014. A configurable state class method for temporal analysis of time Petri nets. IEEE Trans. Syst. Man Cybernet. Syst. 44, 44 (2014), 482--493.Google ScholarCross Ref
- Wojciech Penczek and Agata Pĺörola. 2004. Specification and model checking of temporal properties in time Petri nets and timed automata. In Proceedings of the International Conference on Applications and Theory of Petri Nets. 37--76.Google ScholarCross Ref
- Hind Rakkay and Hanifa Boucheneb. 2007. A more efficient time Petri net state space abstraction preserving linear properties. In Proceedings of the 7th International Conference on Application of Concurrency to System Design. 61--70. Google ScholarDigital Library
- Tomas G. Rokicki and Chris J. Myers. 1994. Automatic verification of timed circuits. In Computer Aided Verification. Springer-Verlag, 468--480. Google ScholarDigital Library
- Alexei Semenov and Alexandre Yakovlev. 1996. Verification of asynchronous circuits using time Petri net unfolding. In Proceedings of the 33rd Design Automation Conference. 59--62. Google ScholarDigital Library
- Kang G. Shin and Parameswaran Ramanathan. 1994. Real-time computing: A new discipline of computer science and engineering. Proc. IEEE 82, 1 (1994), 6--24.Google ScholarCross Ref
- Ferucio L. Tiplea and Ioana Leahu. 2016. The reversible released form of Petri nets and its applications to soundness of workflow nets. IEEE Trans. Syst. Man Cybernet. Syst. 46, 2 (2016), 303--312.Google ScholarCross Ref
- Jeffrey J. P. Tsai, Steve Jennhwa Yang, and Yao Hsiung Chang. 1995. Timing constraint Petri nets and their application to schedulability analysis of real-time system specifications. IEEE Trans. Softw. Eng. 21, 1 (1995), 32--49. Google ScholarDigital Library
- Enrico Vicario. 2001. Static analysis and dynamic steering of time-dependent systems. IEEE Trans. Softw. Eng. 27, 8 (2001), 728--748. Google ScholarDigital Library
- Wattana Viriyasitavat, Lida Xu, and Wantanee Viriyasitavat. 2014. A new approach for compliance checking in service workflows. IEEE Trans. Industr. Informat. 10, 2 (2014), 1452--1460.Google ScholarCross Ref
- Haisheng Wang, Liviu Grigore, Ugo Buy, Mihai Lehene, and Houshang Darabi. 2011. Enforcing periodic transition deadlines in time Petri nets with net unfoldings. IEEE Trans. Syst. Man Cybernet. Part A Syst. Hum. 41, 3 (2011), 522--539. Google ScholarDigital Library
- Jiacun Wang, Y. Deng, and G. Xu. 2000. Reachability analysis of real-time systems using time Petri nets. IEEE Trans. Syst. Man Cybernet. Part B Cybernet. 30, 5 (2000), 725--36. Google ScholarDigital Library
- N. Wightkin, U. Buy, and H. Darabi. 2011. Formal modeling of sequential function charts with time Petri nets. IEEE Trans. Control Syst. Technol. 19, 2 (2011), 455--464.Google ScholarCross Ref
- Jianjia Wu and Wei Zhao. 2013. WInternet: From net of things to Internet of Things. J. Comput. Res. Dev. 50, 6 (2013), 1127--1134.Google Scholar
- Rong Yang, Bing Li, and Can Cheng. 2014. A Petri net-based approach to service composition and monitoring in the IOT. In Proceedings of the 2014 Asia-Pacific Services Computing Conference (APSCC’14). IEEE, Los Alamitos, CA, 16--22. Google ScholarDigital Library
- Tomohiro Yoneda and Hikaru Ryuba. 1998. CTL model checking of time Petri nets using geometric regions. IEICE Trans. Info. Syst. E99-D, 3 (1998), 297--306. http://ci.nii.ac.jp/naid/110003209969/en/.Google Scholar
- Yingfeng Zhang, Wenbo Wang, Naiqi Wu, and Cheng Qian. 2016. IoT-enabled real-time production performance analysis and exception diagnosis model. IEEE Trans. Auto. Sci. Eng. 13, 3 (2016), 1318--1332.Google ScholarCross Ref
Index Terms
- Time-Soundness of Time Petri Nets Modelling Time-Critical Systems
Recommendations
Non Equivalence between Time Petri Nets and Time Stream Petri Nets
PNPM '99: Proceedings of the The 8th International Workshop on Petri Nets and Performance ModelsIt had been shown that Merlin's Time Petri Nets are a special case of Time Stream Petri Nets. In this paper, we show that it does not exist a time equivalence between both models. We extend first this result to the nonequivalence of Timed Automata and ...
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
With this contribution, we aim to draw a comprehensive classification of Petri nets with stopwatches w.r.t. expressiveness and decidability issues. This topic is too ambitious to be summarized in a single paper. That is why we present our results in two ...
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
With this contribution, we aim to draw a comprehensive classification of Petri nets with stopwatches w.r.t. expressiveness and decidability issues. This topic is too ambitious to be summarized in a single paper. That is why we present our results in two ...
Comments