Deciding framed bisimilarity

Electronic Notes in Theoretical Computer Science

Volumn 68, Issue 6, 2003, Pages 1-18

  Huttel, Hans ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; CRYPTOGRAPHY; NETWORK PROTOCOLS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; SYNTACTICS; THEOREM PROVING;

BEHAVIORAL EQUIVALENCE; CRYPTOGRAPHIC PROTOCOLS; FRAMED BISIMILARITY; SPI-CALCULUS;

LINEAR ALGEBRA;

EID: 18944367110     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80530-9     Document Type: Conference Paper

References (16)

1. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi-calculus. In Fourth ACM Conference on Computer and Communications Security. ACM Press, 1997.
2. Abadi M., Gordon A.D. A bisimulation method for cryptographic protocols. Nordic Journal of Computing. 5:(4):Winter 1998;267-303
3. R.M. Amadio, D. Lugiez. On the reachability problem in cryptographic protocols Proceedings of CONCUR 00, LNCS 1877, Springer-Verlag.
4. Boreale, Michele & De Nicola, Rocco & Pugliese, Rosario. Proof Techniques for Cryptographic Processes (Extended version). Proceedings of LICS 99, pp. 157-166, 1999.
5. Boreale M., Trevisan L. A Complexity Analysis of Bisimilarity for Value-passing Processes. Theoretical Computer Science. Vol. 238:(Number 1-2):May 2000;313-345
6. J. Borgström and U. Nestmann On Bisimulations for the Spi Calculus In Proceedings of AMAST 2002, LNCS 2422, pp. 287-303, September 2002.
7. Dam Mads. On the Decidability of Process Equivalences for the π-Calculus. Theoretical Computer Science. vol. 183:1997;215-228
8. A.S. Elkjær, H. Hüttel M. Höhle and K. O. Nielsen. Towards automatic bisimilarity checking in the spi calculus. Proceedings of DMTCS'99 and CATS'99. Australian Computer Science Communications, 21 (3), Springer, 1999.
9. U. Frendrup and J. Nyholm Jensen. Bisimilarity in the Spi-Calculus, Masters' Thesis, Department of Computer Science, Aalborg University, June 2001.
10. Hans Hüttel, Josva Kleist, Uwe Nestmann and Björn Victor. A symbolic semantics for the spi-calculus. Unpublished manuscript.
11. Huimin Lin. Complete Proof Systems for Observation Congruences in Finite-Control Pi-calculus. In Kim G. Larsen and Mogens Nielsen (editors), Automata, Languages and Programming, 25th Colloquium. Volume 1443 of Lecture Notes in Computer Science, pages 443-454, Aalborg, Denmark, July 1998, Springer-Verlag.
12. Milner Robin, Parrow Joachim, Walker David. A Calculus of Mobile Processes, Parts I and II. Information and Computation. vol. 100:(1):1992;1-77
13. Milner Robin. Communicating and mobile systems: the π-calculus. 1999;Cambridge University Press
14. Minsky Marvin. Computation: Finite and Infinite Machines. 1967;Prentice-Hall
15. Rocco De Nicola and Matthew C. B. Hennessy. Testing equivalence for processes. In Josep Díaz (editor) Automata, Languages and Programming, 10th Colloquium. Volume 154 of Lecture Notes in Computer Science, pages 548-560, Barcelona, Spain, 18-22 July 1983. Springer-Verlag.
16. Sangiorgi Davide. A theory of bisimulation for the π-calculus. Acta Informatica. vol. 33:1996;69-97