LTS Semantics for Process Calculi from Their Graphical Encodings

The behaviour of a computational device is often naturally defined by means of reduction semantics: a set representing the possible states of the device, and an unlabelled relation among them, usually inductively defined, representing the possible evolutions of the device. Despite the advantage of conveying the semantics with few compact rewriting rules, freely instantiated and contextualized, the main drawback of reduction-based solutions is that the dynamic behaviour of a system is described in a monolithic way, and so it can be interpreted only by inserting the system in appropriate contexts, where a reduction may take place.

[1]  Fabio Gadducci.  Graph rewriting for the pi-calculus , 2007, Math. Struct. Comput. Sci..

[2]  Marino Miculan,et al.  Deriving Barbed Bisimulations for Bigraphical Reactive Systems , 2009, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[3]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[4]  Hartmut Ehrig,et al.  Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts , 2006, Mathematical Structures in Computer Science.

[5]  Fabio Gadducci,et al.  Reactive Systems, Barbed Semantics, and the Mobile Ambients , 2009, FoSSaCS.

[6]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[7]  Marsha Chechik,et al.  CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings , 2008, CONCUR.

[8]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[9]  Fabio Gadducci,et al.  Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) , 2008, EXPRESS.

[10]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[11]  Julian Rathke,et al.  Deriving Structural Labelled Transitions for Mobile Ambients , 2008, CONCUR.

[12]  Fabio Gadducci,et al.  A Concurrent Graph Semantics for Mobile Ambients , 2001, MFPS.

[13]  Fabio Gadducci,et al.  Process Bisimulation Via a Graphical Encoding , 2006, ICGT.

[14]  Fabio Gadducci,et al.  Saturated LTSs for Adhesive Rewriting Systems , 2010, ICGT.

[15]  Fabio Gadducci,et al.  A Decentralized Implementation of Mobile Ambients , 2008, ICGT.

[16]  Francesco Zappa Nardelli,et al.  Behavioural Theory for Mobile Ambients , 2004, IFIP TCS.