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]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

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

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

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

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

[6]  Marcelo P. Fiore A Coinduction Principle for Recursive Data Types Based on Bisimulation , 1996, Inf. Comput..

[7]  B. Courcelle Fundamental properties of infinite trees , 1983 .

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

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

[10]  Stephen Wilson,et al.  The Beauty of Fractals: Images of Complex Dynamical Systems by Heinz Otto Peitgen, Peter Richter (review) , 2017 .

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

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

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

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

[15]  Dean Isaacson,et al.  Markov Chains: Theory and Applications , 1976 .

[16]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

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

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

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

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

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