Hierarchical Graph Rewriting as a Unifying Tool for Analyzing and Understanding Nondeterministic Systems

  • Kazunori Ueda
  • Takayuki Ayano
  • Taisuke Hori
  • Hiroki Iwasawa
  • Seiji Ogawa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5684)

Abstract

We have designed and implemented LMNtal (pronounced “elemental”), a language based on hierarchical graph rewriting that allows us to encode diverse computational models involving concurrency, mobility and multiset rewriting. Towards its novel applications, the system has recently evolved into a model checker that employs LMNtal as the modeling language and PLTL as the specification language. The strengths of our LMNtal model checker are its powerful data structure, highly nondeterministic computation it can express, and virtually no discrepancy between programming and modeling languages. Models expressed in Promela, MSR, and Coloured Petri Nets can be easily encoded into LMNtal. The visualizer of the LMNtal IDE turned out to be extremely useful in understanding models by state space browsing. The LMNtal IDE has been used to run and visualize diverse examples taken from the fields of model checking, concurrency and AI search.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cervesato, I., et al.: A Meta-notation for Protocol Analysis. In: Proc. CSFW 1999, pp. 55–69. IEEE Computer Society, Los Alamitos (1999)Google Scholar
  2. 2.
    Holzmann, G.: The SPIN Model Checker. Addison-Wesley, Reading (2004)Google Scholar
  3. 3.
    Murayama, K., et al.: Implementation of the Hierarchical Graph Rewriting Language LMNtal. Computer Software 25(2), 47–77 (2008)Google Scholar
  4. 4.
    Ueda, K., Kato, N.: LMNtal: A Language Model with Links and Membranes. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 110–125. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Ueda, K.: Encoding Distributed Process Calculi into LMNtal. Electronic Notes in Theoretical Computer Science 209, 187–200 (2008)CrossRefMATHGoogle Scholar
  6. 6.
    Ueda, K.: Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 392–408. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Kazunori Ueda
    • 1
  • Takayuki Ayano
    • 1
  • Taisuke Hori
    • 1
  • Hiroki Iwasawa
    • 1
  • Seiji Ogawa
    • 1
  1. 1.Dept. of Computer Science and EngineeringWaseda UniversityTokyoJapan

Personalised recommendations