Snapshot Reachability Graphs for Alvis Models

  • Marcin Szpyrka
  • Leszek Kotulski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6881)

Abstract

An embedded system usually consists of a set of sensors cooperating with one or more decisions centres. The design of such a system complicates in respect of both a complicated scheme of components interconnections and their parallel execution. In practice, the latter one excludes testing as a way to guarantee an expected level of a system quality. Thus, a formal verification of such systems is necessary. Alvis is a novel modelling language designed especially for embedded systems. However, it can be used for modelling any information system with concurrent activities. The key concept of Alvis is an agent that denotes any distinguished part of the system under consideration with defined identity persisting in time. The behaviour of agents is defined using Alvis Code Language (AlvisCL) that resembles high level programming languages. Interconnections among agents are defined using Communication Diagrams (AlvisCD) – a visual hierarchical modelling notation. For formal verification purposes, an LTS graph (Labelled Transition System) is generated for an Alvis model. The paper deals with the problem of encoding time relationships with LTS graphs if a model with agents that run concurrently is considered. As a solution, snapshot reachability graphs are proposed.

Keywords

Modelling Language Embed System System Layer Label Transition System Process Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77(4), 541–580 (1989)CrossRefGoogle Scholar
  2. 2.
    Jensen, K.: Coloured Petri Nets. In: Basic Concepts, Analysis Methods and Practical Use, vol. 1-3. Springer, Heidelberg (1992)Google Scholar
  3. 3.
    Bengtsson, J., Yi, W.: Timed automata: Semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 87–124. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Szpyrka, M.: Analysis of RTCP-nets with reachability graphs. Fundamenta Informaticae 74(2-3), 375–390 (2006)MathSciNetMATHGoogle Scholar
  5. 5.
    Samolej, S., Rak, T.: Simulation and performance analysis of distributed internet systems using TCPNs. Informatica (Slovenia) 33(4), 405–415 (2009)Google Scholar
  6. 6.
    Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. Elsevier Science, Upper Saddle River (2001)MATHGoogle Scholar
  7. 7.
    Hoare, C.A.R.: Communicating sequential processes. Prentice-Hall, Inc., Upper Saddle River (1985)MATHGoogle Scholar
  8. 8.
    Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)MATHGoogle Scholar
  9. 9.
    Aceto, L., Ingófsdóttir, A., Larsen, K., Srba, J.: Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, Cambridge (2007)CrossRefMATHGoogle Scholar
  10. 10.
    Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Szpyrka, M., Matyasik, P., Mrówka, R.: Alvis – modelling language for concurrent systems. In: Bouvry, P., González-Vélez, H., Kołodziej, J. (eds.) Intelligent Decision Systems in Large-Scale Distributed Environments. SCI, vol. 362, pp. 315–341. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  12. 12.
    Balicki, K., Szpyrka, M.: Formal definition of XCCS modelling language. Fundamenta Informaticae 93(1-3), 1–15 (2009)MathSciNetMATHGoogle Scholar
  13. 13.
    Matyasik, P.: Design and analysis of embedded systems with XCCS process algebra. PhD thesis, AGH University of Science and Technology, Faculty of Electrical Engineering, Automatics, Computer Science and Electronics, Kraków, Poland (2009)Google Scholar
  14. 14.
    Barnes, J.: Programming in Ada 2005. Addison Wesley, Reading (2006)Google Scholar
  15. 15.
    ISO: Information processing systems, open systems interconnection LOTOS. Technical Report ISO 8807 (1989)Google Scholar
  16. 16.
    Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2006: A toolbox for the construction and analysis of distributed processes. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 158–163. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  17. 17.
    Object Management Group: OMG Systems Modeling Language (OMG Sys ML) (2008)Google Scholar
  18. 18.
    Ashenden, P.: The Designer’s Guide to VHDL, 3rd edn., vol. 3. Morgan Kaufmann, San Francisco (2008)MATHGoogle Scholar
  19. 19.
    Berry, G.: The Esterel v5 Language Primer Version v5 91. Centre de Mathématiques Appliquées Ecole des Mines and INRIA (2000)Google Scholar
  20. 20.
    Palshikar, G.: An introduction to Esterel. Embedded Systems Programming 14(11) (2001)Google Scholar
  21. 21.
    Esterel Technologies SA: Welcome to SCADE 6.0. (2007)Google Scholar
  22. 22.
    Szpyrka, M.: Alvis On-line Manual. AGH University of Science and Technology (2011), http://fm.ia.agh.edu.pl/alvis:manual
  23. 23.
    O’Sullivan, B., Goerzen, J., Stewart, D.: Real World Haskell. O’Reilly Media, Sebastopol (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Marcin Szpyrka
    • 1
  • Leszek Kotulski
    • 1
  1. 1.Department of AutomaticsAGH University of Science and TechnologyKrakowPoland

Personalised recommendations