Probabilistic and Mobile Processes

[1]  Robin Milner,et al.  Synthesis of Communicating Behaviour , 1978, MFCS.

[2]  Davide Sangiorgi,et al.  Bisimulation in name-passing calculi without matching , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[3]  B. Pierce,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[4]  Jun Pang,et al.  Compositional Reasoning for Probabilistic Finite-State Behaviors , 2005, Processes, Terms and Cycles.

[5]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[6]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[7]  Suzana Andova,et al.  Process Algebra with Probabilistic Choice , 1999, ARTS.

[8]  Rocco De Nicola,et al.  KLAIM: A Kernel Language for Agents Interaction and Mobility , 1998, IEEE Trans. Software Eng..

[9]  Yuxi Fu,et al.  Tau laws for pi calculus , 2003, Theor. Comput. Sci..

[10]  Davide Sangiorgi.  pi-Calculus, Internal Mobility, and Agent-Passing Calculi , 1996, Theor. Comput. Sci..

[11]  James Worrell,et al.  A behavioural pseudometric for probabilistic transition systems , 2005, Theor. Comput. Sci..

[12]  Huimin Lin.  Complete inference systems for weak bisimulation equivalences in the pi-calculus , 2003, Inf. Comput..

[13]  Raghu Ramakrishnan,et al.  Database Management Systems , 1976 .

[14]  Yuxin Deng,et al.  Axiomatizations for Probabilistic Finite-State Behaviors , 2005, FoSSaCS.

[15]  Scott A. Smolka,et al.  Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.

[16]  James Worrell,et al.  An Algorithm for Quantitative Verification of Probabilistic Transition Systems , 2001, CONCUR.

[17]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.

[18]  Erik P. de Vink,et al.  Probabilistic Automata: System Types, Parallel Composition and Comparison , 2004, Validation of Stochastic Systems.

[19]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[20]  Jan A. Bergstra,et al.  Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..

[21]  Y. Fisher.  Mathematical background , 1995 .

[22]  Ralph Loader.  Notes on Simply Typed Lambda Calculus , 1998 .

[23]  Davide Sangiorgi,et al.  Towards an algebraic theory of typed mobile processes , 2006, Theor. Comput. Sci..

[24]  Mariëlle Stoelinga,et al.  Alea jacta est : verification of probabilistic, real-time and parametric systems , 2002 .

[25]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

[26]  Julian Rathke,et al.  Typed behavioural equivalences for processes in the presence of subtyping , 2004, Math. Struct. Comput. Sci..

[27]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[28]  Christel Baier,et al.  Weak Bisimulation for Fully Probabilistic Processes , 1997, FBT.

[29]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[30]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[31]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[32]  Chris M. N. Tofts,et al.  Processes with probabilities, priority and time , 1994, Formal Aspects of Computing.

[33]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[34]  Jos C. M. Baeten,et al.  A Ground-Complete Axiomatization of Finite State Processes in Process Algebra , 2005, CONCUR.

[35]  Nobuko Yoshida,et al.  Strong normalisation in the pi -calculus , 2004, Inf. Comput..

[36]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[37]  Scott A. Smolka,et al.  A complete axiom system for finite-state probabilistic processes , 2000, Proof, Language, and Interaction.

[38]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[39]  Nobuko Yoshida,et al.  Noninterference through flow analysis , 2005, J. Funct. Program..

[40]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[41]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[42]  Insup Lee,et al.  Weak Bisimulation for Probabilistic Systems , 2000, CONCUR.

[43]  Catuscia Palamidessi,et al.  Probabilistic Asynchronous pi-Calculus , 2000, FoSSaCS.

[44]  Roberto Segala,et al.  Axiomatizations for Probabilistic Bisimulation , 2001, ICALP.

[45]  Uwe Nestmann.  What is a "Good" Encoding of Guarded Choice? , 2000, Inf. Comput..

[46]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[47]  Gérard Boudol,et al.  On Strong Normalization in the Intersection Type Discipline , 2003, TLCA.

[48]  Roberto Segala,et al.  Decision Algorithms for Probabilistic Bisimulation , 2002, CONCUR.

[49]  Joachim Parrow,et al.  An introduction to the pi-calculus , 2001 .

[50]  Davide Sangiorgi,et al.  Controlling interference in ambients , 2000, POPL '00.

[51]  Davide Sangiorgi,et al.  Termination of processes , 2006, Mathematical Structures in Computer Science.

[52]  Wang Yi,et al.  Testing Probabilistic and Nondeterministic Processes , 1992, PSTV.

[53]  Radha Jagadeesan,et al.  Metrics for labelled Markov processes , 2004, Theor. Comput. Sci..

[54]  Naoki Kobayashi.  Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness , 2000, IFIP TCS.

[55]  Robin Milner,et al.  The Problem of "Weak Bisimulation up to" , 1992, CONCUR.

[56]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[57]  Frank S. Beckman.  Mathematical foundations of programming , 1980 .

[58]  Yuxi Fu,et al.  Variations on Mobile Processes , 1999, Theor. Comput. Sci..

[59]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, Inf. Comput..

[60]  Vasco Thudichum Vasconcelos,et al.  Principal Typing Schemes in a Polyadic pi-Calculus , 1993, CONCUR.

[61]  Robin Milner,et al.  A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..

[62]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[63]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[64]  Tom Chothia,et al.  Metrics for Action-labelled Quantitative Transition Systems , 2006, QAPL.

[65]  Bent Thomsen.  A Theory of Higher Order Communicating Systems , 1995, Inf. Comput..

[66]  Martín Abadi,et al.  Secrecy by typing in security protocols , 1999, JACM.

[67]  James Riely,et al.  Information flow vs. resource access in the asynchronous pi-calculus , 2000, TOPL.

[68]  Naoki Kobayashi.  A partially deadlock-free typed process calculus , 1998, TOPL.

[69]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[70]  Richard Statman,et al.  The Typed lambda-Calculus is not Elementary Recursive , 1979, Theor. Comput. Sci..

[71]  Davide Sangiorgi,et al.  Ensuring termination by typability , 2006, Inf. Comput..

[72]  Nachum Dershowitz,et al.  Natural Termination , 1995, Theor. Comput. Sci..

[73]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[74]  Nobuko Yoshida,et al.  Secure Information Flow as Typed Process Behaviour , 2000, ESOP.

[75]  David A. Wagner,et al.  Intercepting mobile communications: the insecurity of 802.11 , 2001, MobiCom '01.

[76]  Davide Sangiorgi,et al.  Algebraic Theories for Name-Passing Calculi , 1995, Inf. Comput..

[77]  Cédric Fournet,et al.  The Join Calculus: A Language for Distributed Mobile Programming , 2000, APPSEM.

[78]  Radha Jagadeesan,et al.  The metric analogue of weak bisimulation for probabilistic processes , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[79]  Davide Sangiorgi.  Typed pi-calculus at Work: A Correctness Proof of Jones's Parallelisation Transformation on Concurrent Objects , 1999, Theory Pract. Object Syst..

[80]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[81]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[82]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and asynchronous $pi$-calculi , 2003, Mathematical Structures in Computer Science.