
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yongzhi Cao, "Reliability of Mobile Processes with Noisy Channels," IEEE Transactions on Computers, vol. 61, no. 9, pp. 12171230, Sept., 2012.  
BibTex  x  
@article{ 10.1109/TC.2011.147, author = {Yongzhi Cao}, title = {Reliability of Mobile Processes with Noisy Channels}, journal ={IEEE Transactions on Computers}, volume = {61}, number = {9}, issn = {00189340}, year = {2012}, pages = {12171230}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2011.147}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Reliability of Mobile Processes with Noisy Channels IS  9 SN  00189340 SP1217 EP1230 EPD  12171230 A1  Yongzhi Cao, PY  2012 KW  Approximate bisimulation KW  asynchronous \picalculus KW  bisimilarity KW  noisy channel KW  reliability. VL  61 JA  IEEE Transactions on Computers ER   
[1] R. Milner, J. Parrow, and D. Walker, "A Calculus of Mobile Processes, Parts I and II," Information and Computation, vol. 100, pp. 177, 1992.
[2] R. Milner, Communicating and Mobile Systems: The $\pi$ Calculus. Cambridge Univ. Press, 1999.
[3] D. Sangiorgi and D. Walker, The $\pi$ Calculus: A Theory of Mobile Processes. Cambridge Univ. Press, 2001.
[4] P.A. Abdulla, N. Bertrand, A.M. Rabinovich, and P. Schnoebelen, "Verification of Probabilistic Systems with Faulty Communication," Information and Computation, vol. 202, no. 2, pp. 141165, 2005.
[5] P.A. Abdulla, A. Annichini, and A. Bouajjani, "Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol," Proc. Fifth Int'l Conf. Tools and Algorithms for Construction and Analysis of Systems (TACAS '99), pp. 208222, 1999.
[6] P.A. Abdulla, L. Boasson, and A. Bouajjani, “Effective Lossy Queue Languages,” Proc. 28th Int'l Colloquium Automata, Languages and Programming (ICALP '01), pp. 639651, 2001.
[7] P.A. Abdulla, A. Bouajjani, and B. Jonsson, “OntheFly Analysis of Systems with Unbounded, Lossy FIFO Channels,” Proc. 10th Int'l Conf. Computer Aided Verification (CAV '98), pp. 305318, 1998.
[8] P.A. Abdulla and B. Jonsson, “Undecidable Verification Problems for Programs with Unreliable Channels,” Information and Computation, vol. 130, no. 1, pp. 7190, 1996.
[9] P.A. Abdulla and B. Jonsson, “Verifying Programs with Unreliable Channels,” Information and Computation, vol. 127, no. 2, pp. 91101, 1996.
[10] S.P. Iyer and M. Narasimha, “Probabilistic Lossy Channel Systems,” Proc. Seventh Int'l Joint Conf. Theory and Practice of Software Development (TAPSOFT '97), pp. 667681, 1997.
[11] M. Berger and K. Honda, “The TwoPhase Commitment Protocol in an Extended $\pi$ Calculus,” Electrical Notes in Theoretical Computer Science, vol. 39, pp. 2146, 2003.
[12] M. Berger, “Basic Theory of Reduction Congruence for Two Timed Asynchronous $\pi$ Calculi,” Proc. Int'l Conf. Concurrency Theory (CONCUR '04), pp. 115130, 2004.
[13] M. Berger and N. Yoshida, “Timed, Distributed, Probabilistic, Typed Processes,” Proc. Fifth Asian Conf. Programming Languages and Systems (APLAS '07), pp. 158174, 2007.
[14] M. Ying, “$\pi$ Calculus with Noisy Channels,” Acta Informatica, vol. 41, pp. 525593, 2005.
[15] M. Ying, Topology of Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent. SpringerVerlag, 2001.
[16] M. Ying, “Bisimulation Indexes and Their Applications,” Theoretical Computer Science, vol. 275, pp. 168, 2002.
[17] M. Ying, “Reasoning about Probabilistic Sequential Programs in a Probabilistic Logic,” Acta Informatica, vol. 39, pp. 315389, 2003.
[18] Y. Cao, “A Hierarchy of Behavioral Equivalences in the $\pi$ Calculus with Noisy Channels,” Computer J., vol. 53, no. 1, pp. 320, 2010.
[19] G. Boudol, “Asynchrony and the $\pi$ Calculus (Note),” INRIA SophiaAntipolis, Rapport de Recherche 1702, May 1992.
[20] K. Honda and M. Tokoro, “An Object Calculus for Asynchronous Communication,” Proc. European Conf. ObjectOriented Programming (ECOOP '91), pp. 133147, 1991.
[21] C.E. Shannon, “A Mathematical Theory of Communication, I, II,” Bell System Technical J., vol. 27, pp. 379423, 623656, JulyOct. 1948.
[22] K. Honda and N. Yoshida, “On ReductionBased Process Semantics,” Theoretical Computer Science, vol. 151, no. 2, pp. 437486, 1995.
[23] K.G. Larsen and A. Skou, “Bisimulation through Probabilistic Testing,” Information and Computation, vol. 94, pp. 128, 1991.
[24] A. Giacalone, C. Jou, and S. Smolka, “Algebraic Reasoning for Probabilistic Concurrent Systems,” Proc. IFIP TC2 Working Conf. Programming Concepts and Methods, pp. 453459, 1990.
[25] J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden, “Metrics for Labeled Markov Systems,” Proc. 10th Int'l Conf. Concurrency Theory (CONCUR '99), pp. 258273, 1999.
[26] F. van Breugel and J. Worrell, “Towards Quantitative Verification of Probabilistic Transition Systems,” Proc. 28th Int'l Colloquium Automata, Languages and Programming (ICALP '01), pp. 421432, 2001.
[27] Y. Deng, T. Chothia, C. Palamidessi, and J. Pang, “Metrics for ActionLabelled Quantitative Transition Systems,” Electrical Notes in Theoretical Computer Science, vol. 153, no. 2, pp. 7996, 2006.
[28] S. Tini, “Non Expansive $\epsilon$ Bisimulations,” Proc. 12th Int'l Conf. Algebric, Methodology and Software Technology (AMAST '08), pp. 362376, 2008.
[29] S. Tini, “NonExpansive $\epsilon$ Bisimulations for Probabilistic Processes,” Theoretical Computer Science, vol. 411, nos. 2224, pp. 22022222, 2010.
[30] M. Ying and M. Wirsing, “Approximate Bisimilarity,” Proc. Eighth Int'l Conf. Algebric, Methodology and Software Technology (AMAST '00), pp. 309322, 2000.
[31] J. Zhang and Z. Zhu, “A Behavioural Pseudometric Based on $\lambda$ Bisimilarity,” Electrical Notes in Theoretical Computer Science, vol. 220, no. 3, pp. 115127, 2008.
[32] J. Zhang and Z. Zhu, “Characterize Branching Distance in Terms of ($\eta$ , $\alpha$ )Bisimilarity,” Information and Computation, vol. 206, no. 8, pp. 953965, 2008.
[33] R.M. Amadio, I. Castellani, and D. Sangiorgi, “On Bisimulations for the Asynchronous $\pi$ Calculus,” Theoretical Computer Science, vol. 195, no. 2, pp. 291324, 1998.
[34] J. Desharnais, R. Jagadeesan, V. Gupta, and P. Panangaden, “The Metric Analogue of Weak Bisimulation for Probabilistic Processes,” Proc. 17th Ann. IEEE Symp. Logic in Computer Science (LICS '02), pp. 413422, 2002.
[35] F. van Breugel and J. Worrell, “A Behavioural Pseudometric for Probabilistic Transition Systems,” Theoretical Computer Science, vol. 331, no. 1, pp. 115142, 2005.
[36] A. Aldini, M. Bravetti, and R. Gorrieri, “A ProcessAlgebraic Approach for the Analysis of Probabilistic Noninterference,” J. Computer Security, vol. 12, no. 2, pp. 191245, 2004.
[37] A. Aldini, M. Bravetti, A. Di Pierro, R. Gorrieri, C. Hankin, and H. Wiklicky, “Two Formal Approaches for Approximating Noninterference Properties,” Foundations of Security Analysis and Design II: FOSAD 2001/2002, pp. 143, 2004.
[38] A. Girard and G. Pappas, “Approximation Metrics for Discrete and Continuous Systems,” IEEE Trans. Automatic Control, vol. 52, no. 5, pp. 782798, May 2007.
[38] A. Girard and G. Pappas, “Approximation Metrics for Discrete and Continuous Systems,” IEEE Trans. Automatic Control, vol. 52, no. 5, pp. 782798, May 2007.
[40] E.P. de Vink and J. Rutten, “Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach,” Theoretical Computer Science, vol. 221, nos. 1/2, pp. 271293, 1999.
[41] T. Cover and J. Thomas, Elements of Information Theory. John Wiley & Sons, 2006.
[42] D. MacKay, Information Theory, Inference, and Learning Algorithms. Cambridge Univ. Press, 2003.
[43] Y. Deng and W. Du, “Probabilistic Barbed Congruence,” Electrical Notes and Theoretical Computer Science, vol. 190, no. 3, pp. 185203, 2007.
[44] Y. Deng and C. Palamidessi, “Axiomatizations for Probabilistic FiniteState Behaviors,” Theoretical Computer Science, vol. 373, nos. 1/2, pp. 92114, 2007.
[45] J. GoubaultLarrecq, C. Palamidessi, and A. Troina, “A Probabilistic Applied PiCalculus,” Proc. Asian Symp. Programming Languages and Systems (APLAS '07), pp. 175190, 2007.
[46] R.J. van Glabbeek, S.A. Smolka, and B. Steffen, “Reactive, Generative, and Stratified Models of Probabilistic Processes,” Information and Computation, vol. 121, no. 1, pp. 5980, 1995.
[47] O.M. Herescu and C. Palamidessi, “Probabilistic Asynchronous $\pi$ Calculus,” Proc. Third Int'l Conf. Foundations of Software Science and Computation Structures (FOSSACS '00), pp. 146160, 2000.
[48] O.M. Herescu, “The Probabilistic Asynchronous PiCalculus,” dissertation, Pennsylvania State Univ., Dec. 2002.
[49] G. Norman, C. Palamidessi, D. Parker, and P. Wu, “Model Checking the Probabilistic $\pi$ Calculus,” Proc. Fourth Int'l Conf. Quantitative Evaluation of Systems (QEST '07), pp. 169178, 2007.
[50] G. Norman, C. Palamidessi, D. Parker, and P. Wu, “Model Checking Probabilistic and Stochastic Extensions of the $\pi$ Calculus,” IEEE Trans. Software Eng., vol. 35, no. 2, pp. 209223, Mar./Apr. 2009.
[51] M. Kwiatkowska, G. Norman, D. Parker, and M. Vigliotti, “Probabilistic Mobile Ambients,” Theoretical Computer Science, vol. 410, nos. 12/13, pp. 12721303, 2009.
[52] P. Sylvain and C. Palamidessi, “Expressiveness of Probabilistic $\pi$ Calculus,” Electrical Notes in Theoretical Computer Science, vol. 164, no. 3, pp. 119136, 2006.
[53] M. Ying, “Additive Models of Probabilistic Processes,” Theoretical Computer Science, vol. 275, nos. 1/2, pp. 481519, 2002.
[54] B. Aziz, “Measuring the Speed of Information Leakage in Mobile Processes,” Proc. 11th Int'l Conf. Algebraic Methodology and Software Technology (AMAST '06), pp. 3650, 2006.
[55] M. Backes, “Quantifying Probabilistic Information Flow in Computational Reactive Systems,” Proc. 10th European Symp. Research in Computer Security (ESORICS), pp. 336354, 2005.
[56] M. Boreale, “Quantifying Information Leakage in Process Calculi,” Proc. Int'l Colloquium Automata, Languages and Programming (ICALP '06), pp. 119131, 2006.
[57] M. Boreale, “Quantifying Information Leakage in Process Calculi,” Information and Computation, vol. 207, no. 6, pp. 699725, 2009.
[58] H. Chen and P. Malacaria, “Quantitative Analysis of Leakage for MultiThreaded Programs,” Proc. Workshop Programming Languages and Analysis for Security (PLAS '07), pp. 3140, 2007.