Backup of LMNtal (No. 14)

[ Front page | List of pages | Search | Recent changes | Backup | Help ]

• List of Backups
• View the diff.
• View the diff current.
• View the source.
• Go to LMNtal.
  • 1 (2006-05-17 (Wed) 04:37:22)
  • 2 (2006-05-21 (Sun) 16:50:11)
  • 3 (2006-05-26 (Fri) 20:18:59)
  • 4 (2006-05-29 (Mon) 02:26:53)
  • 5 (2006-12-14 (Thu) 15:32:30)
  • 6 (2009-07-09 (Thu) 07:24:52)
  • 7 (2009-11-30 (Mon) 06:31:30)
  • 8 (2010-05-28 (Fri) 14:03:05)
  • 9 (2010-05-28 (Fri) 14:03:05)
  • 10 (2010-06-10 (Thu) 06:46:29)
  • 11 (2010-06-10 (Thu) 06:46:29)
  • 12 (2010-06-17 (Thu) 03:27:53)
  • 13 (2010-11-26 (Fri) 02:24:49)
  • 14 (2011-06-12 (Sun) 03:32:30)
  • 15 (2012-05-10 (Thu) 03:39:00)
  • 16 (2012-05-10 (Thu) 15:54:21)
  • 17 (2014-06-05 (Thu) 01:22:55)
  • 18 (2015-05-20 (Wed) 12:24:41)
  • 19 (2017-03-02 (Thu) 03:32:49)
  • 20 (2017-03-02 (Thu) 04:53:03)

---

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,
• dynamic migration of processes and rewrite rules, and
• graphical view of programs and computation (see Figure below).

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.

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.

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.

Developers

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

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

   

Modified by uedalab LMNtal group

PukiWiki 1.5.1 © 2001-2016 PukiWiki Development Team
Powered by PHP 7.4.3-4ubuntu2.20

HTML convert time to 0.008 sec.