A theory of bisimulation for the &lgr;-calculus
Acta Informatica
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
Saturated Semantics for Reactive Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
A Well-behaved LTS for the Pi-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
Recent Trends in Algebraic Development Techniques
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Observing reductions in nominal calculi via a graphical encoding of processes
Processes, Terms and Cycles
| Hi-index | 0.00 |
We investigate Leifer and Milner RPO approach for deriving efficient (finitely branching) LTS's and bisimilarities for p-calculus. To this aim, we work in a category of second-order term contexts and we apply a general pruning technique, which allows to simplify the set of transitions in the LTS obtained from the original RPO approach. The resulting LTS and bisimilarity provide an alternative presentation of symbolic LTS and Sangiorgi's open bisimilarity.