We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
Monads as an organizing principle for programming and semantics are notoriously difficult to grasp, yet they are a central and powerraction in Haskell. This paper introduces a do...
Pericles S. Kariotis, Adam M. Procter, William L. ...
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
: UML currently still lacks a rigorously defined semantics for its models, which makes formally analyzing a model and verifying its properties extremely difficult. To remedy that, ...
We deal with temporal aspects of distributed systems, introducing and studying a new model called timed distributed -calculus. This model extends distributed -calculus with timers...