Team Comète

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Major publications by the team in recent years

[1]
M. Bhargava, C. Palamidessi.
Probabilistic Anonymity, in: Proceedings of CONCUR, M. Abadi, L. de Alfaro (editors), Lecture Notes in Computer Science, Springer, 2005, vol. 3653, p. 171–185
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/concur.pdf.
[2]
K. Chatzikokolakis, C. Palamidessi.
Probable Innocence Revisited, in: Theoretical Computer Science, 2006, vol. 367, no 1-2, p. 123–138
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/reportPI.pdf.
[3]
P. Giambiagi, G. Schneider, F. D. Valencia.
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi., in: Proceedings of FoSSaCS, Lecture Notes in Computer Science, Springer, 2004, vol. 2987, p. 226-240
http://www.brics.dk/~fvalenci/papers/fossacs04.pdf.
[4]
O. M. Herescu, C. Palamidessi.
On the Generalized Dining Philosophers Problem, in: Proceedings of the 20th ACM Symposium on Principles of Distributed Computing, 2001, p. 81–89
http://www.lix.polytechnique.fr/~catuscia/papers/Gen_Phil/podc.ps.
[5]
R. McDowell, D. Miller, C. Palamidessi.
Encoding transition systems in sequent calculus, in: Theoretical Computer Science, 2003, vol. 294, no 3, p. 411-437
http://www.lix.polytechnique.fr/~catuscia/papers/Tran_Sys_in_SC/tcs.ps.
[6]
M. Nielsen, C. Palamidessi, F. Valencia.
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications, in: Nordic Journal of Computing, 2002, vol. 9, p. 145–188
http://www.lix.polytechnique.fr/~catuscia/papers/Ntcc/njc02.ps.
[7]
C. Palamidessi, O. M. Herescu.
A randomized encoding of the $ \pi$ -calculus with mixed choice, in: Theoretical Computer Science, 2005, vol. 335, no 2-3, p. 73-404
http://www.lix.polytechnique.fr/~catuscia/papers/prob_enc/report.pdf.
[8]
C. Palamidessi.
Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculus, in: Mathematical Structures in Computer Science, 2003, vol. 13, no 5, p. 685–719
http://www.lix.polytechnique.fr/~catuscia/papers/pi_calc/mscs.pdf.
[9]
C. Palamidessi, V. A. Saraswat, F. D. Valencia, B. Victor.
On the Expressiveness of Linearity vs Persistence in the Asynchronous pi-calculus, in: Proceedings of the Twenty First Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society, 2006, p. 59–68
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/LICS_06/main.pdf.
[10]
F. D. Valencia.
Decidability of infinite-state timed CCP processes and first-order LTL, in: Theoretical Computer Science, 2005, vol. 330, no 3, p. 577–607
http://www.brics.dk/~fvalenci/papers/tcs.pdf.

Publications of the year

Articles in refereed journals and book chapters

[11]
D. Cacciagrano, F. Corradini, C. Palamidessi.
Separation of synchronous and asynchronous communication via testing, in: Theoretical Computer Science, to appear, 2006.
[12]
K. Chatzikokolakis, C. Palamidessi.
A Framework for Analyzing Probabilistic Protocols and its Application to the Partial Secrets Exchange, in: Theoretical Computer Science, to appear, 2006
http://www.lix.polytechnique.fr/~catuscia/papers/PartialSecrets/TCSreport.pdf.
[13]
K. Chatzikokolakis, C. Palamidessi.
Probable Innocence Revisited, in: Theoretical Computer Science, 2006, vol. 367, no 1-2, p. 123–138
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/tcsPI.pdf.
[14]
Y. Deng, C. Palamidessi.
Axiomatizations for probabilistic finite-state behaviors, to appear, 2006
http://www.lix.polytechnique.fr/~catuscia/papers/Prob_Axiom/tcs.pdf.
[15]
R. Lanotte, A. Maggiolo-Schettini, A. Troina.
Parametric Probabilistic Transition Systems for System Design and Analysis, in: Formal Aspects of Computing, to appear, 2006
http://www.lix.polytechnique.fr/~troina/publications/fac06.pdf.
[16]
C. Palamidessi, F. Valencia.
Languages for Concurrency, in: Bulletin of the European Association for Theoretical Computer Science, Column: Programming Languages, October 2006, vol. 90, p. 155–171
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/EATCS_06/paper.pdf.

Publications in Conferences and Workshops

[17]
D. Cacciagrano, F. Corradini, C. Palamidessi.
Fair $ \upper_pi$ , in: Proceedings of the 13th International Workshop on Expressiveness in Concurrency (EXPRESS), Electronic Notes in Theoretical Computer Science, to appear, Elsevier Science B.V., 2006
http://www.lix.polytechnique.fr/~catuscia/papers/Diletta/FairPi/express06.pdf.
[18]
D. Cacciagrano, F. Corradini, C. Palamidessi.
Separation of synchronous and asynchronous communication via testing, in: Proceedings of the 12th International Workshop on Expressiveness in Concurrency (EXPRESS), Electronic Notes in Theoretical Computer Science, Elsevier Science B.V., 2006, vol. 154, no 3, p. 95–108
http://www.lix.polytechnique.fr/~catuscia/papers/Diletta/Must/report.pdf.
[19]
K. Chatzikokolakis, C. Palamidessi.
Probable Innocence Revisited, in: Third International Workshop on Formal Aspects in Security and Trust (FAST), Revised Selected Papers, T. Dimitrakos, F. Martinelli, P. Y. A. Ryan, S. A. Schneider (editors), Lecture Notes in Computer Science, Springer, 2006, vol. 3866, p. 142-157
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/reportPI.pdf.
[20]
K. Chatzikokolakis, C. Palamidessi, P. Panangaden.
Anonymity Protocols as Noisy Channels, in: Postproceedings of the Symp. on Trustworthy Global Computing, Lecture Notes in Computer Science, to appear, Springer, 2006
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/Channels/full.pdf.
[21]
T. Chothia.
Analysing the Mute Anonymous File-Sharing System Using the Pi-calculus, in: 26th IFIP WG 6.1 international conference on formal techniques for networked and distributed systems – FORTE 2006, E. Najm, J.-F. Pradat-Peyre, V. Viguié Donzeau-Gouge (editors), Lecture Notes in Computer Science, Springer, September 2006, no 4229, p. 115–130.
[22]
Y. Deng, T. Chothia, C. Palamidessi, J. Pang.
Metrics for Action-labelled Quantitative Transition Systems, in: Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005), Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers, 2006, vol. 153, no 2, p. 79–96
http://www.lix.polytechnique.fr/~catuscia/papers/Metrics/QAPL/gts.pdf.
[23]
Y. Deng, C. Palamidessi, J. Pang.
Weak Probabilistic Anonymity, in: Postproceedings of the 3rd International Workshop on Security Issues in Concurrency (SecCo), Electronic Notes in Theoretical Computer Science, To appear, Elsevier Science B.V., 2006
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/report_wa.pdf.
[24]
Y. Deng, J. Pang, P. Wu.
Measuring Anonymity with Relative Entropy, in: Proceedings of the 4th International Workshop on Formal Aspects in Security and Trust (FAST), Lecture Notes in Computer Science, To appear, Springer, 2006.
[25]
H. A. López, C. Palamidessi, J. A. Pérez, C. Rueda, F. D. Valencia.
A Declarative Framework for Security: Secure Concurrent Constraint Programming, in: Proceedings of the 22nd International Conference on logic Programming, (ICLP), S. Etalle, M. Truszczynski (editors), Lecture Notes in Computer Science, Springer, 2006, vol. 4079, p. 449–450.
[26]
C. Palamidessi.
Anonymity in probabilistic and nondeterministic system, in: Proceedings of the Workshop on ``Algebraic Process Calculi: The First Twenty Five Years and Beyond'', Bertinoro, Italy, Electronic Notes in Theoretical Computer Science, to appear, Elsevier Science B.V., 2006
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/Bertinoro/paper.pdf.
[27]
C. Palamidessi.
Probabilistic and nondeterministic aspects of Anonymity, in: Proceedings of the 21st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXI), Birmingham, UK, Electronic Notes in Theoretical Computer Science, Elsevier Science B.V., 2006, vol. 155, p. 33–42
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/MFPS/paper.pdf.
[28]
C. Palamidessi, I. Phillips, M. G. Vigliotti.
Expressiveness via Leader Election Problems, in: Postproceedings of the 5th International Symposium on Formal Methods for Components and Objects (FMCO), Lecture Notes in Computer Science, to appear, Springer, 2006
http://www.lix.polytechnique.fr/~catuscia/papers/2006/MariaGrazia/FMCO/fmco-06.pdf.
[29]
C. Palamidessi, V. A. Saraswat, F. D. Valencia, B. Victor.
On the Expressiveness of Linearity vs Persistence in the Asynchronous pi-calculus, in: Proceedings of the Twenty First Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society, 2006, p. 59–68
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/LICS_06/main.pdf.
[30]
C. Palamidessi, F. Valencia.
Expressiveness of Recursion, Replication and Scope Mechanisms in Process Calculi, in: Postproceedings of the 5th International Symposium on Formal Methods for Components and Objects (FMCO), Lecture Notes in Computer Science, to appear, Springer, 2006
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/FMCO_06/paper.pdf.
[31]
S. Pradalier, C. Palamidessi.
Expressiveness of probabilistic $ \pi$ -calculi, in: Proceedings of QAPL, to appear, 2006
http://www.lix.polytechnique.fr/~catuscia/papers/Sylvain/QAPL06/FinalBis.pdf.
[32]
J. G. J. P. C. Rueda, F. D. Valencia.
Timed Concurrent Constraint Programming for Analyzing Biological Systems., in: Proceedings of Workshop on Membrane Computing and Biologically Inspired Process Calculi., Electronic Notes in Theoretical Computer Science, to appear, Elsevier Science B.V., 2006
http://www.brics.dk/~fvalenci/papers/bioccp.pdf.
[33]
A. Ziegler, D. Miller, C. Palamidessi.
A Congruence Format for Name-passing Calculi, in: Proceedings of the 2nd Workshop on Structural Operational Semantics (SOS), Lisbon, Portugal, Electronic Notes in Theoretical Computer Science, Elsevier Science B.V., 2006, vol. 156, no 1, p. 169–189
http://www.lix.polytechnique.fr/~catuscia/papers/Axelle/SOS_05/report.pdf.

Internal Reports

[34]
J. Aranda, C. D. Giusto, M. Nielsen, F. Valencia.
CCS with Replication in the Chomsky Hierarchy, Technical report, LIX, Ecole Polytechnique, 2006.

References in notes

[35]
M. Abadi, A. D. Gordon.
A Calculus for Cryptographic Protocols: The Spi Calculus, in: Information and Computation, 10 January 1999, vol. 148, no 1, p. 1–70.
[36]
A. Aldini, R. Gorrieri.
Security Analysis of a Probabilistic Non-repudiation Protocol, in: Process Algebra and Probabilist Methods. Performance Modeling and Verification: Second Joint International Workshop PAPM-PROBMIV 2002, Copenhagen, Denmark, July 25–26, 2002. Proceedings, Heidelberg, H. Hermanns, R. Segala (editors), Lecture Notes in Computer Science, Springer, 2002, vol. 2399, 17 p.
[37]
R. M. Amadio, I. Castellani, D. Sangiorgi.
On Bisimulations for the Asynchronous $ \pi$ -Calculus, in: Theoretical Computer Science, An extended abstract appeared in Proceedings of CONCUR '96, LNCS 1119: 147–162, 1998, vol. 195, no 2, p. 291–324.
[38]
R. M. Amadio, D. Lugiez.
On the reachability problem in cryptographic protocols, in: Proceedings of CONCUR 00, Lecture Notes in Computer Science, INRIA Research Report 3915, Springer, march 2000, vol. 1877
http://hal.inria.fr/inria-00072738.
[39]
M. Bhargava, C. Palamidessi.
Probabilistic Anonymity, in: Proceedings of CONCUR, M. Abadi, L. de Alfaro (editors), Lecture Notes in Computer Science, Springer, 2005, vol. 3653, p. 171–185
http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/report.pdf.
[40]
M. Bodirsky, J. Nesetril.
Constraint Satisfaction with Countable Homogeneous Templates, in: Computer Science Logic, M. Baaz, J. Makowsky (editors), LNCS, Springer, 2003, vol. 2803, p. 44–57.
[41]
M. Boreale.
On the expressiveness of internal mobility in name-passing calculi, in: Theoretical Computer Science, A preliminary version of this paper appeared in the Proceedings of CONCUR'96, volume 1119 of LNCS., March 1998, vol. 195, no 2, p. 205–226.
[42]
G. Boudol.
Asynchrony and the $ \pi$ -calculus (Note), Rapport de Recherche, INRIA, Sophia-Antipolis, 1992, no 1702
http://hal.inria.fr/inria-00076939.
[43]
J. Bowen, D. Bahler.
Conditional Existence of Variables in Generalized Constraint Networks, in: Proc. 9th. National Conference of the American Association for Artificial Intelligence, 1991, p. 215-220.
[44]
E. Brinksma, A. Rensink, W. Vogler.
Fair Testing, in: Proceedings of the 6th International Conference on Concurrency Theory (CONCUR), I. Lee, S. A. Smolka (editors), Lecture Notes in Computer Science, Springer-Verlag, 1995, vol. 962, p. 313–327.
[45]
N. Busi, M. Gabbrielli, G. Zavattaro.
Replication vs. recursive definition in Channel Based Calculi, in: Proc. of ICALP 03, LNCS, Springer-Verlag, 2003.
[46]
N. Busi, M. Gabbrielli, G. Zavattaro.
Comparing Recursion, Replication, and Iteration in Process Calculi, in: Proc. of ICALP 04, LNCS, Springer-Verlag, 2004.
[47]
N. Busi, G. Zavattaro.
On the Expressive Power of Movement and Restriction in Pure Mobile Ambients, in: Theoretical Computer Science, 2004, vol. 322(3), p. 477-515.
[48]
I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, A. Scedrov.
Relating Strands and Multiset Rewriting for Security Protocol Analysis, in: 13th IEEE Computer Security Foundations Workshop — CSFW'00, Cambrige, UK, P. Syverson (editor), IEEE Computer Society Press, 3–5 July 2000, p. 35–51.
[49]
I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, A. Scedrov.
A Meta-Notation for Protocol Analysis, in: Proceedings of the 12th IEEE Computer Security Foundations Workshop — CSFW'99, Mordano, Italy, R. Gorrieri (editor), IEEE Computer Society Press, 28–30 June 1999, p. 55–69.
[50]
K. Chatzikokolakis, C. Palamidessi.
A Framework for Analyzing Probabilistic Protocols and its Application to the Partial Secrets Exchange, in: Proceedings of the Symp. on Trustworthy Global Computing, Lecture Notes in Computer Science, Springer-Verlag, 2005, vol. 3705, p. 146-162
http://www.lix.polytechnique.fr/~catuscia/papers/PartialSecrets/tgc05.pdf.
[51]
H. Comon, V. Cortier, J. Mitchell.
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols, in: International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 2001, vol. 2076.
[52]
K. Compton, S. Dexter.
Proof Techniques for Cryptographic Protocols, in: Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Springer, 1999, vol. 1644, p. 25–39.
[53]
G. Costa, C. Stirling.
A Fair Calculus of Communicating Systems, in: Acta Informatica, 1984, vol. 21, p. 417–441.
[54]
G. Costa, C. Stirling.
Weak and Strong Fairness in CCS, in: Information and Computation, June 1987, vol. 73, no 3, p. 207–244.
[55]
G. Delzanno, A. Podelski.
Model checking in CLP, in: Proc. of TACAS'99, LNCS, Springer Verlag, 1999, vol. 1579, p. 223–239.
[56]
G. Denker, J. Meseguer, C. Talcott.
Protocol specification and analysis in Maude, in: Proceedings of Workshop on Formal Methods and Security Protocols, 1998.
[57]
S. Eilenberg.
Automata, Languages, and Machines, Academic Press, 1974.
[58]
S. Even, O. Goldreich, A. Lempel.
A randomized protocol for signing contracts, in: Commun. ACM, 1985, vol. 28, no 6, p. 637–647.
[59]
F. J. T. Fábrega, J. C. Herzog, J. D. Guttman.
Strand spaces: Why is a security protocol correct?, in: Proceedings of the 1998 IEEE Symposium on Security and Privacy, IEEE Computer Society Press, may 1998, p. 160–171.
[60]
B. Faltings, S. Macho.
Open Constraint Satisfaction, in: Proc. of Principles and Practice of Constraint Programming, LNCS, Springer-Verlag, 2002, vol. 2470, p. 356-370.
[61]
L. Fribourg.
Constraint Logic Programming Applied to Model Checking, in: Proc. of LOPSTR'99, LNCS, Springer Verlag, 1999, vol. 1817, p. 30–41.
[62]
J. Goubault-Larrecq.
A method for automatic cryptographic protocol verification, in: Proceedings of the 15 IPDPS 2000 Workshops, Lecture Notes in Computer Science, Springer, may 2000, vol. 1800, p. 977–984.
[63]
O. M. Herescu, C. Palamidessi.
Probabilistic Asynchronous $ \pi$ -Calculus, in: Proceedings of FOSSACS 2000 (Part of ETAPS 2000), J. Tiuryn (editor), Lecture Notes in Computer Science, Springer, 2000, vol. 1784, p. 146–160
http://www.lix.polytechnique.fr/~catuscia/papers/Prob_asy_pi/fossacs.ps.
[64]
K. Honda, M. Tokoro.
An Object Calculus for Asynchronous Communication, in: Proceedings of the European Conference on Object-Oriented Programming (ECOOP), P. America (editor), Lecture Notes in Computer Science, Springer, 1991, vol. 512, p. 133–147.
[65]
G. Lowe.
Casper: A Compiler for the Analysis of Security Protocols, in: Proceedings of 10th IEEE Computer Security Foundations Workshop, Also in Journal of Computer Security, Volume 6, pages 53-84, 1998, 1997.
[66]
J. Millen, G. Denker.
CAPSL and MuCAPSL, in: Journal of Telecommunications and Information Technology, 2002.
[67]
D. Miller.
Encryption as an Abstract Data-Type: An extended abstract, in: Proceedings of FCS'03: Foundations of Computer Security, I. Cervesato (editor), 2003, p. 3-14
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/fcs03.pdf.
[68]
R. Milner.
Communication and Concurrency, International Series in Computer Science, Prentice Hall, 1989.
[69]
R. Milner, J. Parrow, D. Walker.
A Calculus of Mobile Processes, I and II, in: Information and Computation, A preliminary version appeared as Technical Reports ECF-LFCS-89-85 and -86, University of Edinburgh, 1989., 1992, vol. 100, no 1, p. 1–40 & 41–77.
[70]
R. Milner, J. Parrow, D. Walker.
Modal logics for mobile processes, in: Theoretical Computer Science, 1993, vol. 114, no 1, p. 149–171.
[71]
M. Mohri.
Edit-Distance Of Weighted Automata: General Definitions And Algorithms, in: International Journal of Foundations of Computer Science, 2003, vol. 14, no 6, p. 957-982.
[72]
D. Monniaux.
Abstracting Cryptographic Protocols with Tree Automata, in: Static Analysis Symposium, Lecture Notes in Computer Science, 1999, vol. 1694, p. 149–163.
[73]
M. Naor, B. Pinkas, R. Sumner.
Privacy preserving auctions and mechanism design, in: Proceedings of the 1st ACM Conference on Electronic Commerce, ACM Press, 1999, p. 129–139.
[74]
V. Natarajan, R. Cleaveland.
Divergence and Fair Testing, in: Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP), Z. Fülöp, F. Gécseg (editors), Lecture Notes in Computer Science, Springer, 1995, vol. 944, p. 648–659.
[75]
U. Nestmann.
What Is a `Good' Encoding of Guarded Choice?, in: Journal of Information and Computation, An extended abstract appeared in the Proceedings of EXPRESS'97, volume 7 of ENTCS, 2000, vol. 156, p. 287–319.
[76]
U. Nestmann.
What Is a `Good' Encoding of Guarded Choice?, in: Proceedings of EXPRESS '97: Expressiveness in Concurrency (Santa Margherita Ligure, Italy, September 8–12, 1997), C. Palamidessi, J. Parrow (editors), Electronic Notes in Theoretical Computer Science, Full version to appear in Information and Computation., Elsevier Science Publishers, 1997, vol. 7.
[77]
U. Nestmann, B. C. Pierce.
Decoding Choice Encodings, in: Proceedings of CONCUR '96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996), U. Montanari, V. Sassone (editors), Lecture Notes in Computer Science, Full version to appear in Information and Computation, Springer, 1996, vol. 1119, p. 179–194.
[78]
R. D. Nicola, M. C. B. Hennessy.
Testing equivalences for processes, in: Theoretical Computer Science, 1984, vol. 34, no 1-2, p. 83–133.
[79]
M. Nielsen, C. Palamidessi, F. D. Valencia.
On the expressive power of temporal concurrent constraint programming languages, in: Proceedings of the Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, ACM Press, October  6–8 2002, p. 156–167
http://www.lix.polytechnique.fr/~catuscia/papers/Ntcc/ppdp02.ps.
[80]
C. Palamidessi, O. M. Herescu.
A randomized encoding of the $ \pi$ -calculus with mixed choice, in: Theoretical Computer Science, 2005, vol. 335, no 2-3, p. 373-404
http://www.lix.polytechnique.fr/~catuscia/papers/prob_enc/report.pdf.
[81]
B. C. Pierce, D. N. Turner.
Pict: A Programming Language Based on the Pi-Calculus, in: Proof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling, M. Tofte (editors), The MIT Press, 1998, p. 455–494.
[82]
A. Pnueli.
The temporal logic of programs, in: Proc. of FOCS-77, IEEE Computer Society Press, IEEE, 1977, p. 46–57.
[83]
M. O. Rabin, D. Lehmann.
On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem, in: A Classical Mind: Essays in Honour of C.A.R. Hoare, A. W. Roscoe (editor), An extended abstract appeared in the Proceedings of POPL'81, pages 133-138., Prentice Hall, 1994, chap. 20, p. 333–352.
[84]
M. O. Rabin.
How to exchange secrets by oblivious transfer, in: Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
[85]
A. W. Roscoe.
Modelling and Verifying Key-Exchange Protocols Using CSP and FDR, in: Proceedings of the 8th IEEE Computer Security Foundations Workshop, IEEE Computer Soc Press, 1995, p. 98–107.
[86]
S. Schneider.
Security properties and CSP, in: Proceedings of the IEEE Symposium Security and Privacy, 1996.
[87]
R. Segala, N. Lynch.
Probabilistic simulations for probabilistic processes, in: Nordic Journal of Computing, An extended abstract appeared in Proceedings of CONCUR '94, LNCS 836: 481-496, 1995, vol. 2, no 2, p. 250–273.
[88]
C. Stirling.
Bisimulation, Model Checking and Other Games, 1998, Notes for Mathfit Instructural Meeting on Games and Computation.
[89]
F. D. Valencia.
Concurrency, Time and Constraints, in: Proc. of the Nineteenth International Conference on Logic Programming (ICLP 2003), LNCS, Springer-Verlag, 2003, p. 72–101.
[90]
R. J. van Glabbeek, S. A. Smolka, B. Steffen.
Reactive, generative, and stratified models of probabilistic processes, in: Information and Computation, 1995, vol. 121, no 1, p. 59–80.

previous
next