Skip to main content

Formal Specification and Verification for Real-Time Scheduling Based on PAR

  • Conference paper
  • First Online:
Structured Object-Oriented Formal Language and Method (SOFL+MSVL 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11392))

Abstract

Scheduling are playing a key role in many real-time systems. The goal of this paper is to apply PAR and its transformation rules to formal specification and verification of real-time scheduling. We formally described three constraints for uniprocessor systems and five constraints for multiprocessor systems. Furthermore, an EDF (Earliest Deadline First) program, written in Apla abstract modelling language, could be automatically transformed to an executable program. Finally, correctness of the EDF program was formally verified by using new strategies of developing loop invariant in PAR and Dijkstra’s Weakest-Precondition theory. Formal specification of schedule constraints for real-time systems highlights PAR’s powerful descriptive ability. Development and verification an EDF scheduling algorithm embody the efficiency and reliability role of PAR Method and PAR Platform.

This work was funded by the National Nature Science Foundation of China (Grant No. 61462041, 61472167, 61662036, 61462039, 61762049, 61862033), the National Natural Science Foundation of Jiangxi Province (Grant No. 20171BAB202008, 20171BAB202013) and the Science and Technology Research Project of Jiangxi Province Educational Department (Grant No. GJJ160329, GJJ150349).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Zhang, F., Burns, A.: Schedulability analysis for real-time systems with EDF scheduling. IEEE Trans. Comput. 58(9), 1250–1258 (2009)

    Article  MathSciNet  Google Scholar 

  2. Cheng, Z., Zhang, H., Tan, Y., Lim, Y.: SMT-based scheduling for overloaded real-time systems. IEICE Trans. Inf. Syst. 100(5), 1055–1066 (2017)

    Article  Google Scholar 

  3. Bjørner, D., Havelund, K.: 40 Years of Formal Methods. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 42–61. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-06410-9_4

    Chapter  MATH  Google Scholar 

  4. Abrial, J.R.: The B book - Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)

    Book  Google Scholar 

  5. Gaudel, M.C.: Formal specification techniques. In: Proceedings of International Conference on Software Engineering. ICSE, vol. 21, pp. 223–227. IEEE (1994)

    Google Scholar 

  6. Bjesse, P.: What is formal verification? ACM (2005)

    Article  Google Scholar 

  7. Clarke, E.M., Wing, J.M.: Formal methods: state of the art and future directions. ACM Comput. Surv. 28(4), 626–643 (1996)

    Article  Google Scholar 

  8. Xue, J.: A unified approach for developing efficient algorithmic programs. J. Comput. Sci. Technol. 12(4), 314–329 (1997)

    Article  MathSciNet  Google Scholar 

  9. Xue, J.: Genericity in PAR Platform. In: Liu, S., Duan, Z. (eds.) SOFL+MSVL 2015. LNCS, vol. 9559, pp. 3–14. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-31220-0_1

    Chapter  Google Scholar 

  10. Xu, H., Xue, J.: The research on implementation method of generic mechanism in Apla \(\rightarrow \) Java program generation system. J. Jiangxi Normal Univ. (Nat. Sci. Edn.) 41(01), 52–55+92 (2017)

    Google Scholar 

  11. Zhou, W., Zuo, Z., Wang, J., Shi, H., You, Z., Xie, W.: The contrastive study of generic programming in object-oriented languages. J. Jiangxi Normal Univ. (Nat. Sci. Edn.) 42(03), 304–310 (2018)

    Google Scholar 

  12. You, Z., Xue, J., Zuo, Z.: Unified formal derivation and automatic verification of three binary-tree traversal non-recursive algorithms. Cluster Comput. J. Netw. Softw. Tools Appl. 19(4), 2145–2156 (2016)

    Google Scholar 

  13. Xue, J.: Formal derivation of graph algorithmic programs using partition and recur. J. Comput. Sci. Technol. 13(6), 553–561 (1998)

    Article  MathSciNet  Google Scholar 

  14. Xue, J., Gries, D.: Developing a linear algorithm for cubing a cycle permutatio. Sci. Comput. Programm. 11, 161–165 (1988)

    Article  Google Scholar 

  15. Xue, J., Yang, B., Zuo, Z.: A linear in-situ algorithm for the power of cyclic permutation. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol. 5059, pp. 113–123. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-69311-6_14

    Chapter  Google Scholar 

  16. Gries, D., Xue, J.: The Hopcroft-Tarjan plannarity algorithm presentations and improvements, TR88-906, CS Department of Cornell University, pp. 1–20 (1988)

    Google Scholar 

  17. Knuth, D.: A simple program whose proof isn’t. In: Feijen, W.H.J., van Gasteren, A.J.M., Gries, D., Misra, J. (eds.) Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra, pp. 233–242. Springer, New York (1990). https://doi.org/10.1007/978-1-4612-4476-9_28

    Chapter  Google Scholar 

  18. Xue, J., Davis R.: A simple program whose derivation and proof is also. In: The First IEEE International Conference On Formal Engineering Method (1997)

    Google Scholar 

  19. Xue, J., Davis, R.: A derivation and proof of Knuths binary to decimal program. Softw. Concepts Tools 12, 149–156 (1997)

    Google Scholar 

  20. Zheng, Y., Xue, J.: A simple greedy algorithm for a class of shuttle transportation problems. Optim. Lett. 3(4), 491–497 (2009)

    Article  MathSciNet  Google Scholar 

  21. Zheng, Y., Ling, H., Xue, J., Chen, S.: Population classification in fire evacuation: a multiobjective particle swarm optimization approach. IEEE Trans. Evol. Comput. 18(1), 70–81 (2014)

    Article  Google Scholar 

  22. Zheng, Y., Ling, H., Chen, S., Xue, J.: A hybrid neuro-fuzzy network based on differential biogeography-based optimization for online population classification in earthquakes. IEEE Trans. Fuzzy Syst. 23(4), 1070–1083 (2014)

    Article  Google Scholar 

  23. Zheng, Y., Zhang, M., Ling, H., Chen, S.: Emergency railway transportation planning using a hyperheuristic approach. IEEE Trans. Intell. Transp. Syst. 16(1), 321–329 (2015)

    Article  Google Scholar 

  24. Zheng, Y., Chen, Q., Ling, H., Xue, J.: Rescue wings: mobile computing and active services support for disaster rescue. IEEE Trans. Serv. Comput. 9(4), 594–607 (2016)

    Article  Google Scholar 

  25. Zheng, Y., Sheng, W., Sun, X., Chen, S.: Airline passenger profiling based on fuzzy deep machine learning. IEEE Trans. Neural Netw. Learn. Syst. 28(12), 2911–2923 (2017)

    Article  MathSciNet  Google Scholar 

  26. Xia, J., Xue, J.: Design and implementation of concurrent distributed transaction in modeling language Apla. In: Conference of NCTCS 2018 (2018, to appear)

    Google Scholar 

  27. Zhu, X., Xue, J., Xia, J., Xiong, X.: The research on implementation method of multimedia database applications in the modeling language Apla. J. Jiangxi Normal Univ. (Nat. Sci. Edn.) 41(01), 46–51 (2017)

    Google Scholar 

  28. Xue, J.: Program specification and its transformation techniques. Comput. Mod. (1993)

    Google Scholar 

  29. Xue, J.: Two new strategies for developing loop invariants and its applications. J. Comput. Sci. Technol. (3) (1993)

    Google Scholar 

  30. Xu, H., You, Z., Xue, J.: Automatic verification of non-recursive algorithm of Hanoi Tower by using Isabelle Theorem Prover. In: 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD), Shanghai, China, pp. 13–18, May 2016

    Google Scholar 

  31. Tian, C., Duan, Z., Zhang, N.: An efficient approach for abstraction-refinement in model checking. Theor. Comput. Sci. 461, 76–85 (2012)

    Article  MathSciNet  Google Scholar 

  32. Zhang, N., Duan, Z., Tian, C.: A complete axiom systems for propositional projection temporal logic with cylinder computation model. Theor. Comput. Sci. 609, 639–657 (2016)

    Article  MathSciNet  Google Scholar 

  33. Duan, Z., Yang, X., Koutny, M.: Framed temporal logic programming. Sci. Comput. Programm. 70(1), 31–61 (2008)

    Article  MathSciNet  Google Scholar 

  34. Derler, P., Lee, E.A., Vincentelli, A.S.: Modeling cyber-physical systems. Proc. IEEE 100(1), 13–28 (2012). (Special issue on CPS)

    Article  Google Scholar 

  35. Liu, C.L., Layland, J.W.: Scheduling algorithm for multi-programming in a hard real-time environment. J. ACM 20(1), 40–61 (1973)

    Article  Google Scholar 

  36. Dertouzos, M.L.: Control robotics: the procedural control of physical processes. In: Proceedings of International Federation for Information Processing (IFIP) Congress, pp. 807–813 (1974)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhuo Cheng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

You, Z., Cheng, Z., Xue, J., Hu, Q., Xie, W. (2019). Formal Specification and Verification for Real-Time Scheduling Based on PAR. In: Duan, Z., Liu, S., Tian, C., Nagoya, F. (eds) Structured Object-Oriented Formal Language and Method. SOFL+MSVL 2018. Lecture Notes in Computer Science(), vol 11392. Springer, Cham. https://doi.org/10.1007/978-3-030-13651-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-13651-2_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-13650-5

  • Online ISBN: 978-3-030-13651-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics