Skip to main content
Log in

Optimizing path real-time logic for unified real-time system

  • Foundations
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

By simply describing a classic weakly hard real-time system’s performance with the number of tasks meeting or missing deadlines, the system’s real-time characteristics cannot be expressed accurately and its reliability cannot be established. The path real-time logic (RTL) is used to determine the reliability of real-time systems; though desirable, it cannot be used as a tool to configure an optimized real-time system. This paper introduces the notion of optimizing path RTL, where integer constants of arithmetic inequality in path RTL are replaced by integer constants or integer variables. With further modifications, optimizing path RTL can not only determine the reliability of a real-time system, but also be used to optimize the system. Furthermore, a unified framework for hard, soft and weakly hard real-time system is established based on optimizing path RTL. The process of transforming a weakly hard real-time system into this unified framework is demonstrated. Moreover, this work proposes and proves a theorem that if the directed ring of a constraint graph contains all elements of behaviour specification (SP) and only SP, then its value must not be greater than zero. This theorem can be used to quickly determine the reliability and safety of a real-time system. A case study is presented to show the validity and reliability of optimizing path RTL and the unified real-time system.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Alves D, NetoDaniel AC, Valcrcel F, Felton R, Lopez JM (2014) A new generation of real-time systems in the JET tokamak. IEEE Trans Nucl Sci 61(2):711–719

    Article  Google Scholar 

  • Andrei S, Cheng AMK (2009) Efficient verification and optimization of real-time logic-specified systems. IEEE Trans Comput 58(12):1640–1653

    Article  MathSciNet  Google Scholar 

  • Andrei S, Chin WN (2004) Incremental satisfiability counting for real-time systems, real-time and embedded technology and applications symposium, 2004. In: Proceedings. RTAS 2004, 10th IEEE, 482–489

  • Bernat G, Burns A, Llamos A (2001) Weakly hard real-time systems. IEEE Trans Comput 50(4):308–321

    Article  MathSciNet  Google Scholar 

  • Chen J-M, Song Y, Sun Y (2006) Research on constraint specification of weakly hard real-time system. J Softw 17(12):2601–2608

    Article  MathSciNet  MATH  Google Scholar 

  • Contreras I, Yiyi Jiang J, Hidalgo I, Nunez-Letamendia L (2012) Using GPU-CPU architecture to speed up a ga-based real-time system for trading the stock market. Soft Comput 16(2):203–215

    Article  Google Scholar 

  • Duan Q, Zeng J, Chakrabarty K (2015) Real-time production scheduler for digital-print-service providers based on a dynamic incremental evolutionary algorithm. IEEE Trans Autom Sci Eng 12(2):701–715

    Article  Google Scholar 

  • Hamdaoui M, Ramanathan P (1995) A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Trans Comput 44(12):1443–1451

    Article  MATH  Google Scholar 

  • Heitmeyer CL, Labaw BG (1993) A benchmark for comparing different approaches for specifying and verifying real-time systems. Naval Research Lab, Washington, DC

    Google Scholar 

  • Jahanian F, Mok AKL (1986) Safety analysis of timing properties in real-time systems. IEEE Trans Softw Eng 12:890–904

    Article  Google Scholar 

  • Jahanian F, Mok AKL (1987) A Graph-theoretic approach for timing analysis and its implementation. IEEE Trans Comput 36:961–975

    Article  MATH  Google Scholar 

  • Jahanian F, Stuart DA (1988) A method for verifying properties of modechart specifications. In: Proceedngs of the ninth IEEE real-time systems symposium, 12–21

  • Lorraine EPR, Cheng AMK (1999) Timing analysis of the X-38 space station crew return vehicle avionics. Real-time technology and applications symposium, 1999. In: Proceedings of the fifth IEEE, 255–264

  • Meng FL, Zeng XJ (2013) A Stackelberg game-theoretic approach to optimal real-time pricing for the smart grid. Soft Comp 17(12):2365–2380

    Article  MATH  Google Scholar 

  • Mok AK, Tsou DC, de Rooij RCM (1996) The MSP. RTL real-time scheduler synthesis tool. In: 17th IEEE real-time systems symposium, 118–128

  • Neto AC, Sartori F, Piccolo F, Vitelli R, De Tommasi G, Zabeo L (2010) MARTe: a multiplatform real-time framework. IEEE Trans Nucl Sci 57(2):479–486

    Article  Google Scholar 

  • Niu L, Xu J ((2012) Improving schedulability and energy performance for weakly hard real-time systems, performance computing and communications conference (IPCCC), 2012 IEEE 31st international, 41–50

  • Quellec G, Lamard M, Cochener B, Cazuguel G (2015) Real-time task recognition in cataract surgery videos using adaptive spatiotemporal polynomials. IEEE Trans Med Imaging 34(4):877–887

    Article  Google Scholar 

  • Sahuquillo J, Hassan H, Petit S, March JL, Duato J (2016) A dynamic execution time estimation model to save energy in heterogeneous multicores running periodic tasks. Future Gen Comput Syst 56:211–219

  • Singh Y, Popli M, Shukla SSP (2012) Energy reduction in weakly hard real time systems. Recent advances in information technology (RAIT). 2012 1st international conference on 2012, 909–915

  • Tsai TH, Fan LF, Chen YS, Yao TS (2016) Triple speed: energy-aware real-time task synchronization in homogeneous multi-core systems. IEEE Trans Comput 65(4):1297–1309

    Article  MathSciNet  MATH  Google Scholar 

  • Wang F, Mok AK (1994) RTL and refutation by positive cycles. FME’94: industrial benefit of formal methods, 659–680

  • West R, Zhang Y, Schwan K, Poellabauer C (2004) Dynamic window-constrained scheduling of real-time streams in media servers. IEEE Trans Comput 53(6):744–759

    Article  Google Scholar 

  • West R, Schwan K, Poellabauer C (1999) Scalable scheduling support for loss and delay constrained media streams, real-time technology and applications symposium, 1999. In: Proceedings of the fifth IEEE, 24–33

  • Wu N, Zhou M (2012) Schedulability analysis and optimal scheduling of dual-arm cluster tools with residency time constraint and activity time variation. IEEE Trans Autom Sci Eng 9:203–209

    Article  Google Scholar 

  • Wu T, Jin S, Chen J-M (2008) A weakly hard real-time schedule algorithm based on cutting down. J Softw 19(7):1837–1846

    Article  MATH  Google Scholar 

  • Zhu X, Chang H, Yi Y, Tao Q (2010) Constraint specification of weakly hard real-time systems based on smooth scheduling. Comput Sci 37(3):204–207

    Google Scholar 

  • Zhu X, Chang H, Yi Y (2012) Novel weakly hard real-time system based on path RTL. J Chin Comput Syst 33(8):1862–1867

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kin Fun Li.

Ethics declarations

Conflict of interest

All authors declare that they have no conflicts of interest.

Ethical approval

This article does no contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by A. Di Nola.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhu, X., Li, K.F. & Chang, H. Optimizing path real-time logic for unified real-time system. Soft Comput 21, 3135–3145 (2017). https://doi.org/10.1007/s00500-016-2178-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-016-2178-y

Keywords

Navigation