Skip to main content
SpringerLink
Log in

Property preservation of refinement for Petri net based representation for embedded systems

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Embedded systems have many applications in our life. Petri net based Representation for Embedded Systems (PRES+) is a promising methodology for modeling, verification, analysis and control of embedded systems. But the state space explosion problem is somewhat tedious for PRES+ to specify and analyze large complex embedded systems. To solve state space explosion problem of PRES+, in this work, we concern with a method for expanding PRES+ model to the desired level of detail using refinement. A kind of refinement approach for PRES+ is proposed. We propose definitions of two PRES+ models have the same dynamic properties, such as reachability, timing and functionality. Reachability, timing and functionality preservations of the refined net are investigated. Definitions of liveness and boundedness of PRES+ are presented. We propose conditions under which liveness and boundedness will be preserved by using this refinement approach. A temperature measure and control example illustrates the efficiency of our refinement approach on practical applications. These results can be applied nicely to solve embedded systems design problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Camposano, R., Wilborg, J.: Embedded system design. Des. Autom. Embed. Syst. 1, 5–50 (1996)

    Article  Google Scholar 

  2. Cortés, L.A.Eles, P.,Peng, Z.: Definitions of equivalence for transformation synthesis of embedded systems. In: The Sixth IEEE International Conference on Engineering of Complex Computer Systems pp.134–142 (2000)

  3. Cortés, L.A., Eles, P., Peng, Z.: Modeling and formal verification of embedded systems based on a Petri net based representation. J. Syst. Architect. 49, 571–598 (2003)

    Article  Google Scholar 

  4. Karlsson, D., Eles, P., Peng, Z.: Formal verification of component-based designs. J. Des. Autom. Embed. Syst. 11, 49–90 (2007)

    Article  Google Scholar 

  5. Karlsson, D., Eles, P., Peng, Z.: Model validation for embedded systems using formal method-aided simulation. LET Comput. Digit. Tech. 2(6), 413–433 (2008)

    Article  Google Scholar 

  6. Bandyopadhyay, S., Banerjee, K., Sarkar, D., Mandal, C.R.: Translation validation for PRES+ models of parallel behaviours via an FSMD equivalence checker. In: Rahaman, H., et al. (eds.) VDAT 2012, LNCS, vol. 7373, pp. 69–78 (2012)

  7. Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

  8. Boucheneb, H., Barkaoui, K., Weslati, K.: Delay-dependent partial order reduction technique for time Petri nets. In: Legay, A., Bozga, M. (eds.) FORMATS 2014, LNCS, vol. 8711, pp. 51–68 (2014)

  9. Jiao, L., Cheung, T.Y., Lu, W.M.: On liveness and boundedness of asymmetric choice nets. Theor. Comput. Sci. 311, 165–197 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Xia, C.: Analysis and application of Petri subnet reduction. J. Comput. 6(8), 1662–1669 (2011)

    Article  Google Scholar 

  11. Shen, Victor R.L., Chung, Y.F., Chen, S.-M., Guo, J.-Y.: A novel reduction approach for Petri net systems based on matching theory. Expert Syst. Appl. 40, 4562–4576 (2013)

    Article  Google Scholar 

  12. Ahmad, F., Huang, H., Wang, X.: Analysis of the Petri net model of parallel manufacturing processes with shared resources. Inf. Sci. 181, 5249–5266 (2011)

    Article  Google Scholar 

  13. Xia, C.: Reduction rules for Petri net based representation for embedded systems. J. Front. Comput. Sci. Technol. 2(6), 614–626 (2008)

    Google Scholar 

  14. Badouel, E., Darondeau, Ph: The synthesis of Petri nets from path-automatic specifications. Inf. Comput. 193, 117–135 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Basile, F., Cordone, R., Piroddi, L.: A branch and bound approach for the design of decentralized supervisors in Petri net models. Automatica 52, 322–333 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lutz-Ley, A., Mellado, E.L.: Synthesis of fault recovery sequences in a class of controlled discrete event systems modeled with Petri nets. Procedia Technol 7, 257–264 (2013)

    Article  Google Scholar 

  17. Xia, C.: Analysis of properties of Petri synthesis net. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006, LNCS vol. 3959, pp. 576–587 (2006)

  18. Xia, C.: Liveness and boundedness analysis of Petri net synthesis. Math. Struct. Comput. Sci. 14(5), 1–19 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  19. Hu, H., Zhou, M., Li, Z.: Algebraic synthesis of timed supervisor for automated manufacturing systems using Petri nets. IEEE Trans. Autom. Sci. Eng. 7(3), 549–557 (2010)

    Article  Google Scholar 

  20. Pouyan, A.A., Shandiz, H.T., Arastehfar, S.: Synthesis a Petri net based control model for a FMS cell. Comput. Ind. 62, 501–508 (2011)

    Article  Google Scholar 

  21. Lakos, C., Lewis, G.: Incremental state space construction of colored Petri nets. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001, LNCS vol. 2075, pp. 263–282 (2001)

  22. Choppy, C., Mayero, M., Petrucci, L.: Colored Petri net refinement specification and correctness proof with Coq. Innov. Syst. Softw. Eng. 6, 195–202 (2010)

    Article  Google Scholar 

  23. Haddad, S., Hennicker, R., Møller, M.H.: Specification of asynchronous component systems with modal I/O—Petri nets. In: Abadi, M., Lluch Lafuente, A. (eds.) TGC 2013, LNCS vol. 8358, pp. 219–234 (2014)

  24. Benzina, D.E., Haddad, S., Hennicker, R.: Refinement and asynchronous composition of modal Petri nets. In: Jensen, K., Donatelli, S., Kleijn, J. (eds.) ToPNoC V, LNCS vol. 6900, pp. 96–120 (2012)

  25. Bera, D., Hee, K.V., Nijmeijer, H.: Modeling hybrid systems with Petri nets. In: Obaidat, M.S., et al. (eds.) Simulation and Modeling Methodologies, Technologies and Applications, Advances in Intelligence Systems and Computation vol. 402. Springer (2015)

  26. Huang, H., Cheung, T.-Y., Mak, W.M.: Structure and behavior preservation by Petri-net-based refinements in system design. Theoret. Comput. Sci. 328, 245–269 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  27. Köhler, M., Rölke, H.: Dynamic transition refinement. Electron. Notes Theor. Comput. Sci. 175, 119–134 (2007)

    Article  Google Scholar 

  28. Li, J., Zhou, M., Dai, X.: Reduction and refinement by algebraic operations for Petri net transformation. IEEE Trans. Syst. Man Cybern.-A 42(5), 1244–1255 (2012)

    Article  Google Scholar 

  29. Xia, C.: Property preservation of Petri refinement net. In: Proceedings of WRI World Congress on Computer and Information Engineering (CSIE 2009), pp. 749–754. Los Angeles (2009)

  30. Xia, C.: Property preservation by Petri-net-based refinements in system design. In: Proceedings of the 9th International Conference for Young Computer Scientists (ICYCS 2008), pp. 240–246 (2008)

  31. Ding, Z., Jiang, C., Zhou, M., Zhang, Y.: Preserving languages and properties in stepwise refinement-based synthesis of Petri nets. IEEE Trans. Syst. Man Cybern. A 38(4), 791–801 (2008)

    Article  Google Scholar 

  32. Xia, C., Zhang, Z., Wang, Z.: Property analysis of refinement of Petri net based representation for embedded systems. Open Autom. Control Syst. J. 5, 214–218 (2013)

    Article  MathSciNet  Google Scholar 

  33. Merlin, P.M.: A study of the recoverability of computing systems. PhD thesis, Univ. of California, Computer Science Dept., Irvine (1974)

  34. Jensen, K.: Colored Petri nets-basic concepts, analysis methods and practical use. In: Basic Concepts. EATCS Monographs on Theoretical Computer Science, vol. 1, pp. 1–234. Springer, Berlin (1992)

  35. Peterson, J.L.: Petri net theory and the modeling of systems. Englewood Cliffs, Prentice-Hall (1981)

    MATH  Google Scholar 

  36. Xuan, J., Luo, X., Zhang, G., Lu, J., Xu, Z.: Uncertainty analysis for the keyword system of web events. IEEE Trans. Syst. Man Cybern. 46(6), 829–842 (2016)

    Article  Google Scholar 

  37. Xu, Z., Luo, X., Wang, L.: Incremental building association link network. Comput. Syst. Sci. Eng. 26(3), 153–162 (2011)

  38. Wang, X., Luo, X., Liu, H.: Measuring the veracity of web event via uncertainty. J. Syst. Softw. 102, 226–236 (2015)

    Article  Google Scholar 

Download references

Acknowledgments

This work was financially supported by the National Natural Science Foundation of China under Grant No. 60573012 and 60721061, and Natural Science Foundation of Shandong Province under Grant No. ZR2012GQ010.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Shandong Jianzhu University, Jinan, 250101, China

    Chuanliang Xia

Authors
  1. Chuanliang Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chuanliang Xia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xia, C. Property preservation of refinement for Petri net based representation for embedded systems. Cluster Comput 19, 1373–1384 (2016). https://doi.org/10.1007/s10586-016-0597-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-016-0597-2

Keywords

Search

Navigation