PiDemos is yet another formalism for process interaction.
"[piDemos is] a small process-oriented discrete event simulation language."

I have previously developped a visual interpretation of this textual language. Also, I have brought it up to life by means of a simulator.
This simulator was based on a graph grammar which, following certain rule patterns, was simulating the behaviour, the semantics of this modelling language.

Bear in mind that this was all done in an AToM³ environment.

Now, what I will show through this project is a way of programming the graph grammars rules (the behaviour of the model)
and then extend this to a PiDemos Kernel, outside of AToM³ as a plug-in to it.
This kernel will take as input a model of the piDemos language (more precisely, the graph from AToM³) and output a trace of the different transformation steps. In principle they should match the trace produced by the graph grammar.

Unit Testing will ensure the correspondance between these 2 approaches.

The ultimate goal is to be able to automatically generate the graph grammar (programmed rewriting system).