Hierarchical graph rewriting as a unifying tool for analyzing and understanding nondeterministic systems

Kazunori Ueda, Takayuki Ayano, Taisuke Hori, Hiroki Iwasawa, Seiji Ogawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationTheoretical Aspects of Computing - ICTAC 2009 - 6th International Colloquium, Proceedings
Pages349-355
Number of pages7
DOIs
Publication statusPublished - 2009 Sep 28
Event6th International Colloquium on Theoretical Aspects of Computing, ICTAC 2009 - Kuala Lumpur, Malaysia
Duration: 2009 Aug 162009 Aug 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5684 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Colloquium on Theoretical Aspects of Computing, ICTAC 2009
CountryMalaysia
CityKuala Lumpur
Period09/8/1609/8/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Hierarchical graph rewriting as a unifying tool for analyzing and understanding nondeterministic systems'. Together they form a unique fingerprint.

  • Cite this

    Ueda, K., Ayano, T., Hori, T., Iwasawa, H., & Ogawa, S. (2009). Hierarchical graph rewriting as a unifying tool for analyzing and understanding nondeterministic systems. In Theoretical Aspects of Computing - ICTAC 2009 - 6th International Colloquium, Proceedings (pp. 349-355). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5684 LNCS). https://doi.org/10.1007/978-3-642-03466-4_24