Applications of Metric Coinduction

Metric coinduction is a form of coinduction that can be used to establish properties of objects constructed as a limit of finite approximations. One can prove a coinduction step showing that some property is preserved by one step of the approximation process, then automatically infer by the coinduction principle that the property holds of the limit object. This can often be used to avoid complicated analytic arguments involving limits and convergence, replacing them with simpler algebraic arguments. This paper examines the application of this principle in a variety of areas, including infinite streams, Markov chains, Markov decision processes, and non-well-founded sets. These results point to the usefulness of coinduction as a general proof technique.

[1]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[2]  Marcelo P. Fiore,et al.  A coinduction principle for recursive data types based on bisimulation , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[3]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[4]  E. Denardo.  CONTRACTION MAPPINGS IN THE THEORY UNDERLYING DYNAMIC PROGRAMMING , 1967 .

[5]  Richard W. Madsen,et al.  Markov Chains: Theory and Applications , 1976 .

[6]  宮沢 政清,et al.  P. Bremaud 著, Markov Chains, (Gibbs fields, Monte Carlo simulation and Queues), Springer-Verlag, 1999年 , 2000 .

[7]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[8]  Paul R. Halmos,et al.  Review: Nelson Dunford and Jacob T. Schwartz, Linear operators. Part I: General theory , 1959 .

[9]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[10]  Samson Abramsky,et al.  A Cook's Tour of the Finitary Non-Well-Founded Sets , 2011, We Will Show Them!.

[11]  Anthony Unwin,et al.  Markov Chains — Theory and Applications , 1977 .

[12]  D. Turi,et al.  Functional Operational Semantics and its Denotational Dual , 1996 .

[13]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[14]  Olle Häggström.  Finite Markov Chains and Algorithmic Applications , 2002 .

[15]  Erik P. de Vink,et al.  Control flow semantics , 1996 .

[16]  Dexter Kozen,et al.  Coinductive Proof Principles for Stochastic Processes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[17]  Bruno Courcelle,et al.  Fundamental Properties of Infinite Trees , 1983, Theor. Comput. Sci..

[18]  Heinz-Otto Peitgen,et al.  The beauty of fractals - images of complex dynamical systems , 1986 .

[19]  J. Schwartz,et al.  Linear Operators. Part I: General Theory. , 1960 .

[20]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[21]  M. Lewin.  On nonnegative matrices , 1971 .

[22]  Nicholas Ruozzi,et al.  Applications of Metric Coinduction , 2007, CALCO.

[23]  Jan J. M. M. Rutten,et al.  Behavioural differential equations: a coinductive calculus of streams, automata, and power series , 2003, Theor. Comput. Sci..

[24]  Lawrence S. Moss,et al.  Vicious circles - on the mathematics of non-wellfounded phenomena , 1996, CSLI lecture notes series.