Three partition refinement algorithms
SIAM Journal on Computing
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A partition refinement algorithm for the &pgr;-calculus
Information and Computation - Special issue on FLOC '96
Nordic Journal of Computing
Pi-Nets: A Graphical Form of pi-Calculus
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Verifying Mobile Processes in the HAL Environment
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
The Mobility Workbench - A Tool for the pi-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Modelling Mobility in High-level Petri Nets
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
Observing reductions in nominal calculi via a graphical encoding of processes
Processes, Terms and Cycles
Parallel computing with the Pi-calculus
Proceedings of the sixth workshop on Declarative aspects of multicore programming
A petri net interpretation of open reconfigurable systems
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
A Petri Net Interpretation of Open Reconfigurable Systems
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
| Hi-index | 0.00 |
This paper introduces the π -graphs, a graphicalmodel of mobile interactions that tries to accommodate theexpressivity of the π -calculus and the intuitiveness ofplace-transition nets. Graph rewriting techniques are used todescribe the operational semantics of π -graphs. Thebijective encoding/decoding of π -graphs allows to mixtransparently graphical and term-based proof techniques, whichleads to a dual characterization of bisimilarity. The mainoriginality of this characterization is the synchronousinterpretation it provides: each graph/term being attached to aclock evolving at the rate of interactions with the environment.This gives new opportunities for the design of efficientverification algorithms for mobile systems.