Skip to main content
SpringerLink
Log in

Formal verification and quantitative metrics of MPSoC data dynamics

  • Original Article
  • Published:
Formal Aspects of Computing

Abstract

Multiprocessor system on chip (MPSoC) implements system functions through tasks. It is necessary to estimate system behaviors early in the design process without actual hardware implementation. As there are a huge variety in freedom of choices in the mapping of tasks, existing researches mainly focus on the schedulability analysis and resource constraints, with a lack of concerning on how data in tasks “behaves” in different schedulings. In practical applications, tasks are achieved by sequential executions of code blocks, which change the variables accordingly. Some variables are shared by all the tasks through global memory, such as public data, critical signals and so on. Changes of these data reflect functions of the system which also deserves attention. Data dynamics can illustrate data changes within a task as well as data exchanges between tasks, and thus can depict scheduling with more detail than just telling whether they can be scheduled. This paper proposes a new formal approach by combing hybrid automata and probabilistic timed automata to model MPSoC data dynamics, describing its real-time scheduling characteristics, concurrency, and probability. Furthermore, we also propose a new quantitative metric for measuring data dynamics named “reach-ratio” to compute the probability, weighted over tasks, of starting a task from which a certain area of the state space can be reached, where the tasks must be started within a time-bound that varies from task to task. The reach-ratio metric, as a supplement of traditional properties such as safety, liveness and fairness, reflects the extent of which the system achieves the intended function at a given scheduling strategy. Case study investigations of our new formal approach provide empirical evidence for MPSoC designers to balance controller policy without hardware implementation.

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

Similar content being viewed by others

References

  1. Alur R, Courcoubetis C, Henzinger TA, Ho PH (1993) Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. Springer, Berlin, pp 209–229

    Google Scholar 

  2. Alur R, Henzinger TA, Ho PH (1996) Automatic symbolic verification of embedded systems. IEEE Trans Softw Eng 22(3): 181–201

    Article  Google Scholar 

  3. Asarin E, Bournez O, Dang T, Maler O, Pnueli A (2000) Effective synthesis of switching controllers for linear systems. Proc IEEE 88(7): 1011–1025

    Article  Google Scholar 

  4. Bak S, Johnson TT, Caccamo M, Sha L (2014) Real-time reachability for verified simplex design. In: Real-time systems symposium (RTSS),2014 IEEE, pp 138–148

  5. Brekling A, Hansen MR, Madsen J (2008) Models and formal verification of multiprocessor system-on-chips. J Log Algebr Program 77(1): 1–19

    Article  MathSciNet  MATH  Google Scholar 

  6. Chutinan A (1999) Hybrid system verification using discrete model approximations. Ph.D. thesis, Carnegie Mellon University

  7. Davoren JM, Nerode A (2000) Logics for hybrid systems. Proc IEEE 88(7): 985–1010

    Article  Google Scholar 

  8. Daws C, Tripakis S (1998) Model checking of real-time reachability properties using abstractions. In: Tools and algorithms for the construction and analysis of systems. Springer, Berlin, pp 313–329

  9. Frehse G (2005) PHAVer: algorithmic verification of hybrid systems past HyTech. In: Morari M, Thiele L (eds) Hybrid systems: computation and control, vol 3414, Lecture Notes in Computer Science. Springer, Berlin, pp 258–273

  10. Frehse G, Le Guernic C, Donzé A, Cotton S, Ray R, Lebeltel O, Ripado R, Girard A, Dang T, Maler O (2011) Spaceex: Scalable verification of hybrid systems. In: Computer aided verification. Springer, Berlin, pp 379–395

  11. Girard A (2005) Reachability of uncertain linear systems using zonotopes. In: Morari M, Thiele L (eds) Hybrid systems: computation and control, vol 3414, Springer, Berlin, pp 291–305

  12. Gu Z (2005) Solving real-time scheduling problems with model-checking. In: Yang LT, Zhou X, Zhao W, Wu Z, Zhu Y, Lin M (eds) Embedded software and systems, proceedings, vol 3820. Springer, Berlin, pp 186–197

  13. Henzinger TA (2000) The theory of hybrid automata. In: Inan MK, Kurshan RP (eds) Verification of digital and hybrid system, vol 170. Springer, Berlin, pp 265–292

  14. Henzinger TA, Ho PH, Wong-Toi H (1998) Algorithmic analysis of nonlinear hybrid systems. IEEE Trans Autom Control 43(4): 540–554

    Article  MathSciNet  MATH  Google Scholar 

  15. Lehoczky JP. (1990) Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Real-time systems symposium, Lake Buena Vista, Florida, 1990. IEEE, pp 201–209

  16. Kurzhanskiy AA, Varaiya P (2007) Ellipsoidal techniques for reachability analysis of discrete-time linear systems. IEEE Trans Autom Control 52(1): 26–38

    Article  MathSciNet  MATH  Google Scholar 

  17. Kwiatkowska M, Norman G, Segala R, Sproston J (2002) Automatic verification of real-time systems with discrete probability distributions. Theor Comput Sci 282(1): 101–150

    Article  MathSciNet  MATH  Google Scholar 

  18. Kwiatkowska M, Norman G, Sproston J (2002) Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. Springer, Berlin, pp 411–423

    MATH  Google Scholar 

  19. Kwiatkowska M, Norman G, Parker D, Sproston J (2006) Performance analysis of probabilistic timed automata using digital clocks. Form Methods Syst Des 29(1): 33–78

    Article  MATH  Google Scholar 

  20. Kwiatkowska M, Norman G, Sproston J, Wang F (2007) Symbolic model checking for probabilistic timed automata. Inf Comput 205(7): 1027–1077

    Article  MathSciNet  MATH  Google Scholar 

  21. Kwiatkowska M, Norman G, Parker D (2009) Stochastic games for verification of probabilistic timed automata. In: Formal modeling and analysis of timed systems. Springer, Berlin, pp 212–227

  22. Kwiatkowska M, Norman G, Parker D (2011) Prism 4.0: verification of probabilistic real-time systems. Springer, Snowbird, pp 585–591

  23. Le Guernic C, Girard A (2009) Reachability analysis of hybrid systems using support functions. In: Computer aided verification. Springer, Berlin, pp 540–554

  24. Li T, Tan F, Wang Q, Bu L, Cao Jn, Liu X (2014) From offline toward real time: a hybrid systems model checking and CPS codesign approach for medical device plug-and-play collaborations. IEEE Trans Parallel Distrib Syst 25(3): 642–652

    Article  Google Scholar 

  25. Madl G, Dutt N, Abdelwahed S (2009) A conservative approximation method for the verification of preemptive scheduling using timed automata. In: 15th IEEE real-time and embedded technology and applications symposium, pp 255–264

  26. Manna Z, Pnueli A (2012) Temporal verification of reactive systems: safety. Springer Science and Business Media

  27. Mutsuda Y, Kato T, Yamane S (2005) Specification and verification techniques of embedded systems using probabilistic linear hybrid automata. In: Embedded software and systems. Springer, pp 346–360

  28. Mysore V, Piazza C, Mishra B (2005) Algorithmic algebraic model checking II: Decidability of semi-algebraic model checking and its applications to systems biology. In: Automated technology for verification and analysis. Springer, pp 217–233

  29. Platzer A (2008) Differential dynamic logic for hybrid systems. J Autom Reason 41(2): 143–189

    Article  MathSciNet  MATH  Google Scholar 

  30. Ratschan S, She Z (2007) Safety verification of hybrid systems by constraint propagation-based abstraction refinement. ACM Trans Embed Comput Syst (TECS) 6(1): 8

    Article  MATH  Google Scholar 

  31. Sha L, Rajkumar R, Sathaye SS (1994) Generalized rate-monotonic scheduling theory: a framework for developing real-time systems. Proc IEEE 82((1): 68–82

    Google Scholar 

  32. Sproston J (2000) Decidable model checking of probabilistic hybrid automata. In: Joseph M (ed) Formal techniques in real-time and fault-tolerant systems, proceedings, vol 1926. Springer, Berlin, pp 31–45

  33. Sankaranarayanan S, Sipma HB, Manna Z (2004) Non-linear loop invariant generation using gröbner bases. ACM SIGPLAN Not 39(1): 318–329

    Article  MATH  Google Scholar 

  34. Stankovic JA, Spuri M, Ramamritham K, Buttazzo G (1998) Deadline scheduling for real-time systems: EDF and related algorithms, vol 460. Springer Science and Business Media, New York

    Book  MATH  Google Scholar 

  35. Visintini AL, Glover W, Lygeros J, Maciejowski J (2006) Monte carlo optimization for conflict resolution in air traffic control. IEEE Trans Intell Transp Syst 7(4): 470–482

    Article  MATH  Google Scholar 

  36. Wolf W (2009) Multiprocessor system-on-chip technology. IEEE Signal Process Mag 26(6): 50–54

    Article  Google Scholar 

  37. Yang H, Kim S, Ha S (2010) An milp-based performance analysis technique for non-preemptive multitasking MPSoC. IEEE Trans Comput Aided Des Integr Circuits Syst 29(10): 1600–1613

    Article  Google Scholar 

  38. Zhang H, Wu J, Tan H, Yang H (2014) Approximate trace equivalence of real-time linear algebraic transition systems. Comput Model New Technol 18(7):36–40

  39. Zhang H, Wu J, Lu J, Tang J (2016) Safety verification of finite real-time nonlinear hybrid systems using enhanced group preserving scheme. Cluster Comput 19(4):2189–2199

Download references

Author information

Authors and Affiliations

  1. Chengdu Institute of Computer Application, Chinese Academy of Sciences, Chengdu, 610041, China

    Hui Zhang

  2. University of Chinese Academy of Sciences, Beijing, 100049, China

    Hui Zhang

  3. Guizhou Bank Postdoctoral Station, Guiyang, 550001, China

    Hui Zhang

  4. Guangxi Key Laboratory of Hybrid Computational and IC Design Analysis, Guangxi University for Nationalities, Guangxi, 53006, China

    Jinzhao Wu

Authors
  1. Hui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinzhao Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinzhao Wu.

Additional information

Naijun Zhan

This research was supported by the National Natural Science Foundation of China under Grant No. 11371003, No. 11461006 and No. 61772206, the Special Fund for Scientific and Technological Bases and Talents of Guangxi under Grant No. 2016AD05050, the Special Fund for Bagui Scholars of Guangxi, and the Science and Technology Program of Guangxi under Grant No. 2017AB0818.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, H., Wu, J. Formal verification and quantitative metrics of MPSoC data dynamics. Form Asp Comp 30, 219–237 (2018). https://doi.org/10.1007/s00165-017-0444-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-017-0444-0

Keywords

Search

Navigation