Skip to main content
SpringerLink
Log in

Structural transformations for data-enriched real-time systems

  • Original Article
  • Published:
Formal Aspects of Computing

Abstract

We investigate design-level structural transformations that aim at easier subsequent verification of real-time systems with shared data variables, modelled as networks of extended timed automata (ETA). Our contributions to this end are the following: (1) we first equip ETA with an operator for layered composition, intermediate between parallel and sequential composition. Under certain non-interference and/or precedence conditions imposed on the structure of the ETA networks, the communication closed layer (CCL) laws and associated partial-order (po-) and (layered) reachability equivalences are shown to hold. (2) Next, we investigate (under certain cycle conditions on the ETA) the (reachability preserving) transformations of separation and flattening aimed at reducing the number of cycles of the ETA. (3) We then show that our separation and flattening in (2) may be applied together with the CCL laws in (1), in order to restructure ETA networks such that the verification of layered reachability properties is rendered easier. This interplay of the three structural transformations (separation, flattening, and layering) is demonstrated on an enhanced version of Fischer’s real-time mutual exclusion protocol for access to multiple critical sections.

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., Dill D. (1994) A theory of timed automata. TCS 126(2): 183–235

    Article  Google Scholar 

  2. Behrmann G, David A, Larsen KG (2004) A tutorial on Uppaal. In: Formal methods for the design of real-time systems, vol 3185 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 200–236

  3. Bengtsson J, Jonsson B, Lilius J, Yi W (1998) Partial order reductions for timed systems. In: Sangiorgi D, de Simone R (eds) CONCUR, vol 1466 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 485–500

  4. Bochmann GV (1979) Distributed synchronization and regularity. Comput Netw 3: 36–43

    Google Scholar 

  5. Bochmann GV (1988) Delay-independent design for distributed systems. IEEE Trans Softw Eng 14(8): 1229–1237

    Article  Google Scholar 

  6. Bouyer P, Petit A (1999) Decomposition and composition of timed automata. In: Wiedermann J, van Emde Boas P, Nielsen M (eds) ICALP, vol 1644 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 210–219

  7. Bornot S, Sifakis J (2000) An algebraic framework for urgency. Inf Comput 163: 172–202

    Article  Google Scholar 

  8. Comon H, Jurski Y (1999) Timed automata and the theory of real numbers. In: Baeten JCM, Mauw S (eds) CONCUR, vol 1664 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 242–257

  9. Chandy KM, Misra J (1988) Parallel program design—a foundation. Addison Wesley, USA

    Google Scholar 

  10. Cohen E (2000) Separation and reduction. In: Backhouse RC, Oliveira JN (eds) Mathematics of program construction, vol 1837 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 45–59

  11. Chaouch-Saad M, Charron-Bost B, Merz S (2009) A reduction theorem for the verification of round-based distributed algorithms. In: Bournez O, Potapov I (eds) Reachability problems, vol 5797 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 93–106

  12. Dong JS, Hao P, Qin S, Sun J, Yi W (2008) Timed automata patterns. IEEE Trans Softw Eng 34(6): 844–859

    Article  Google Scholar 

  13. Dräger K, Kupriyanov A, Finkbeiner B, Wehrheim H (2010) Slab: a certifying model checker for infinite-state concurrent systems. In: Esparza J, Majumdar R (eds) TACAS, vol 6015 of LNCS, pp 271–274

  14. Elrad T, Francez N (1982) Decomposition of distributed programs into communication-closed layers. Sci Comput Program 2: 155–173

    Article  Google Scholar 

  15. Haakansson J, Pettersson P (2007) Partial order reduction for verification of real-time components. In: Raskin J.-F, Thiagarajan PS (eds) FORMATS, vol 4763 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 211–226

  16. Havelund K, Skou A, Larsen KG, Lund K (1997) Formal modeling and analysis of an audio/video protocol: an industrial case study using uppaal. In: RTSS. IEEE Computer Society, pp 2–13

  17. Janssen W (1994) Layered design of parallel systems. PhD thesis, University of Twente

  18. Janssen W, Poel M, Xu Q, Zwiers J (1994) Layering of real-time distributed processes. In: Langmaack H, de Roever WP, Vytopil J (eds) FTRTFT, vol 863 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 393–417

  19. Kushilevitz E, Rabin MO (1992) Randomized mutual exclusion algorithms revisited. In: PODC. ACM Press, pp 275–283

  20. Lugiez D, Niebert P, Zennou S (2005) A partial order semantics approach to the clock explosion problem of timed automata. Theor Comput Sci 345: 27–59

    Article  Google Scholar 

  21. Larsen KG, Steffen B, and Weise C (1996) Fischer’s protocol revisited: a simple proof using modal constraints. In: Alur R, Henzinger TA, Sontag ED (eds) Hybrid systems, vol 1066 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 604–615

  22. Milner R (1986) Communication and concurrency. Prentice Hall, USA

    Google Scholar 

  23. Minea M (1999) Partial order reduction for model checking of timed automata. In: Baeten JCM, Mauw S (eds) CONCUR, vol 1664 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 431–436

  24. Muniz M, Westphal B, Podelski A (2012) Timed automata with disjoint activity. In: Jurdzinski M, Nickovic D (eds) FORMATS, vol 7595 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 188–203

  25. Olderog E.-R, Dierks H (2008) Real-time systems—formal specification and automatic verification. Cambridge University Press, Cambridge

    Book  Google Scholar 

  26. Olderog E.-R, Swaminathan M (2010) Layered composition for timed automata. In: Chatterjee K, Henzinger TA (eds) FORMATS, vol 6246 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 228–242

  27. Olderog E.-R, Swaminathan M (2013) Structural transformations for data-enriched real-time systems. In: Johnsen EB, Petre L (eds) iFM, vol 7940 of LNCS. Springer-Verlag, Berlin Heidelberg, pp 378–393

  28. Peter H.-J, Mattmüller R (2009) Component-based abstraction refinement for timed controller synthesis. In: RTSS. IEEE Computer Society, pp 364–374

  29. Stomp FA, de Roever W.-P (1994) A principle for sequential reasoning about distributed algorithms. Form Asp Comput 6(6): 716–737

    Article  Google Scholar 

  30. Sharma A, Katoen J.-P (2014) Layered reduction for abstract probabilistic automata. In: ACSD. IEEE Computer Society (to appear)

  31. Sharma A, Katoen J.-P (2014) Layered reduction for modal specification theories. In: Fiadeiro JL, Liu Z, Xue J (eds) FACS, vol 8348 of LNCS. Springer-Verlag, Berlin Heidelberg

  32. Swaminathan M, Katoen J.-P, Olderog E.-R (2012) Layered reasoning for randomized distributed algorithms. Form Asp Comput 24: 477–496

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Oldenburg, Oldenburg, Germany

    Ernst-Rüdiger Olderog & Mani Swaminathan

Authors
  1. Ernst-Rüdiger Olderog
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mani Swaminathan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mani Swaminathan.

Additional information

Einar Broch Johnsen, Luigia Petre, and Michael Butler

This work is supported by the German Research Foundation through the Trans-Regio Collaborative Research Center (SFB/TR 14) AVACS (www.avacs.org).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Olderog, ER., Swaminathan, M. Structural transformations for data-enriched real-time systems. Form Asp Comp 27, 727–750 (2015). https://doi.org/10.1007/s00165-014-0306-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-014-0306-y

Keywords

Search

Navigation