Gregory's Server@chainik pretty familiar with graph rewriting ^__^, esp
https://wiki.xxiivv.com/site/interaction_nets.html
|
Top-level
 4 comments
@chainik I hadn't seen Kappa, but it looks like it's petri nets and these sorts of things. Modal, the language I currently use could probably host graph rewriting quite nicely, but its closer languages, I think, are Thue and Maude. The advantage of string rewriting the way modal does it is that it has a nicer UX I find, it's a bit easier to reflect about. I didn't know you were using rewriting systems at all, that's cool :) You're full of surprises.  @neauoire :) yes, it is related to petri nets: graph rewriting on a (labelled) discrete graph is equivalent to a petri net. edges make things more fun, so Kappa is more general. we are working on a yet more general variant called CSet rewriting mainly for use in epidemiology (https://johncarlosbaez.wordpress.com/2024/05/13/agent-based-models-part-9/). we do not yet have a very good surface syntax for it, though, so Modal and Thue (less so Maude, it is quite complicated) are good inspiration. @chainik Whenever you come across interesting(or odd) things that can be done with Kappa, send it my way :) |
@neauoire aha, yes, I remember when you were looking at that. the funny thing is it's related but in some sense quite different from the kind of rewriting systems that we work with (which are part of a broad class of SPO, DPO, SqPO systems, process calculi like the Kappa language, usually the stochastic versions which are good for representing a variety of real-world systems). Your comment about having to think differently to encode things that are straightforward in "normal" languages rang true