Skip to main content
SpringerLink
Log in

Verification of critical systems described in real-time TiMo 

  • FMICS 2015/2016
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

We present a simple prototyping language for describing real-time systems including specific features as timeouts, explicit locations, timed migration and timed communication. The parallel execution of a step is provided by multiset labelled transitions. To illustrate its features, we describe a railway control system, and define some behavioural equivalences matching multisets of actions that could happen in a given interval of time. We define strong time-bounded bisimulation and strong open time-bounded bisimulation, and prove that the latter one is a congruence. By using various bisimulations over the behaviours of real-time systems, we can check which behaviours are closer to an optimal and safe behaviour. Automatic analysis is performed using a verification platform called TiMo@PAT which supports the verification of domain-specific properties like process location reachability, time-bounded properties, as well as optimizing resources.

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

Similar content being viewed by others

References

  1. Aman, B., Ciobanu, G.: Real-time migration properties of TiMo@ PAT verified in Uppaal. Lect. Notes Comput. Sci. 8137, 31–45 (2013)

    Article  Google Scholar 

  2. Aman, B., Ciobanu, G.: Timed mobility and timed communication for critical systems. Lect. Notes Comput. Sci. 9128, 146–161 (2015)

    Article  Google Scholar 

  3. Aman, B., Ciobanu, G., Koutny, M.: Behavioural equivalences over migrating processes with timers. Lect. Notes Comput. Sci. 7273, 52–66 (2012)

  4. Baeten, J.C.M., Middelburg, C.A.: Process Algebra with Timing. Monographs in Theoretical Computer Science. Springer, Berlin (2002)

  5. Ciobanu, G.: Behaviour equivalences in timed distributed \(\pi \)-calculus. Lect. Notes Comput. Sci. 5380, 190–208 (2008)

    Article  Google Scholar 

  6. Ciobanu, G., Juravle, C.: Flexible software architecture and language for mobile agents. Concurr. Comput. Pract. Exp. 24, 559–571 (2012)

    Article  Google Scholar 

  7. Ciobanu, G., Koutny, M.: Timed mobility in process algebra and petri nets. J. Logic Algebr. Program. 80, 377–391 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ciobanu, G., Koutny, M.: Timed migration and interaction with access permissions. Lect. Notes Comput. Sci. 6664, 293–307 (2011)

    Article  MathSciNet  Google Scholar 

  9. Ciobanu, G., Koutny, M.: PerTiMo: a model of spatial migration with safe access permissions. Comput. J. 58, 1041–1060 (2015)

    Article  Google Scholar 

  10. Ciobanu, G., Prisacariu, C.: Timers for distributed systems. Electron. Notes Theor. Comput. Sci. 164, 81–99 (2006)

    Article  Google Scholar 

  11. Ciobanu, G., Zheng, M.: Automatic analysis of TiMo@PAT systems in PAT. In: Proceedings of 18th International Conference on Engineering of Complex Computer Systems. IEEE Computer Society, pp. 121–124 (2013)

  12. Groote, J.F.: Transition system specifications with negative premises. Lect. Notes Comput. Sci. 458, 332–341 (1990)

    Article  Google Scholar 

  13. Han, T., Katoen, J.P., Mereacre, A.: Compositional modeling and minimization of time-inhomogeneous Markov chains. Lect. Notes Comput. Sci. 4981, 244–258 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Heitmeyer, C., Lynch, N.: The generalized railroad crossing: a case study in formal verification of real-time systems. In: Proceedings of IEEE Real-Time Systems Symposium, pp. 120–131 (1994)

  15. Kamide, N.: Bounded linear-time temporal logic: a proof-theoretic investigation. Ann. Pure Appl. Logic 163, 439–466 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. Milner, R.: Communicating and Mobile Systems: The \(\pi \)-Calculus. Cambridge University Press, New York (1999)

    MATH  Google Scholar 

  17. Park, D.: Concurrency and automata on infinite sequences. Lect. Notes Comput. Sci. 104, 167–183 (1981)

    Article  Google Scholar 

  18. Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press, New York (2011)

    Book  MATH  Google Scholar 

  19. Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: towards flexible verification under fairness. Lect. Notes Comput. Sci. 5643, 709–714 (2009)

    Article  Google Scholar 

  20. Yi, W., Pettersson, P., Daniels, M.: Automatic verification of real-time communicating systems by constraint-solving. In: Proceedings of International Conference on Formal Description Techniques, pp. 223–238 (1994)

Download references

Author information

Authors and Affiliations

  1. Romanian Academy, Institute of Computer Science, Blvd. Carol I No. 11, 700506, Iaşi, Romania

    Bogdan Aman & Gabriel Ciobanu

Authors
  1. Bogdan Aman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriel Ciobanu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bogdan Aman.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Aman, B., Ciobanu, G. Verification of critical systems described in real-time TiMo . Int J Softw Tools Technol Transfer 19, 395–408 (2017). https://doi.org/10.1007/s10009-016-0439-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-016-0439-9

Keywords

Search

Navigation