*LMNtal, a unifying language and tool

LMNtal (pronounced "elemental") is a programming and modeling language based on '''hierarchical graph rewriting'''.  It was designed to be a substrate language of diverse computational models, especially those addressing concurrency, mobility and multiset rewriting, including (Colored) Petri Nets, Interaction Nets, the Pi-Calculus, Chemical Abstract Machines, Constraint Handling Rules, and Bigraphs.  It features

-point-to-point '''links''' to represent connectivity,
-'''membranes''' to represent hierarchy,
// -rule-based multiset rewriting,
// -locality of rewrite rules,
-dynamic migration of processes and rewrite rules, and
-graphical view of programs and computation (see Figure below).
// -uniform treatment of processes and data,
// -and so on.

The language has been fully implemented using Java and C.  Various unique features have been integrated into ''LaViT'' ('''LMNtal Visual Tools'''; formerly called LMNtalEditor), an integrated development environment of LMNtal.  LaViT comes with

- '''nondeterministic state-space search''',
- state-space visualizer,
- '''LTL model checker''' (using LMNtal as the modeling language), and
- graph visualizer.

The combination of the above is a unique feature of LMNtal and LaViT, which turns out to be very useful for
'''understanding''' as well as debugging your models and programs.

**Programming and modeling with links and membranes

The power of LMNtal comes from two structuring mechanisms,
-links for expressing connectivity and
-membranes for expressing hierarchy.

The figure below (click to enlarge) illustrates how hierarchical graphs allow you to represent various concepts appearing in computer science. 

// http://www.ueda.info.waseda.ac.jp/lmntal/image/diagrams-low.png

**State-space search and model checking with LaViT

Model checking combined with state-space visualization demonstrates that LaViT is extremely useful for '''understanding''' as well as '''debugging''' your models and programs.  LaViT can be and has been used to run and visualize diverse examples taken from the fields of model checking, concurrency and AI search.

// An implementation (a translator into intermediate code and
// a runtime system) running on a Java platform is available.
// It features 

//-nondeterministic execution (exhaustive search),
//-foreign-language interface to Java,
//-read-eval-print loop,
//-redex/rule selection strategies, and

LMNtal allows extremely terse representation of some transition systems.  For example, with only one rewrite rule, the state space of the Tower of Hanoi can be explored and visualized (click the image to enlarge and view the program):


This conciseness is thanks to the powerful symmetry reduction mechanism inherent in the hierarchical graph representation of states.


The language and the implementation has been developed since 2002 by
the LMNtal team, Dept. of Computer Science and Engineering, Waseda University.

//**Sample Input 1
//    a,a,a,a,a,a, (a,a :- {a}), ({$p,a},{$q} :- $p,$q) 
//**Sample Input 2
//[[Download]] (append.lmn)

mailto: lmntal _AtSign_ ueda.info.waseda.ac.jp

//--started to copy contents -- [[nakajima]] &new{2004-01-30 (Fri) 22:13:40};
//--edited the menubar to hide titles written in EUC-JP -- [[nakajima]] &new{2004-02-01 (Sun) 21:33:05};
//--added edit auth -- [[nakajima]] &new{2004-02-03 (Tue) 17:47:44};
//--new skin installed -- [[nakajima]] &new{2004-02-13 (Fri) 17:19:23};

Front page List of pages Search Recent changes Backup   Help   RSS of recent changes