By Davide Sangiorgi, Jan Rutten
Coinduction is a technique for specifying and reasoning approximately limitless info kinds and automata with countless behaviour. in recent times, it has come to play an ever extra vital position within the idea of computing. it really is studied in lots of disciplines, together with method thought and concurrency, modal common sense and automata thought. mostly, coinductive proofs exhibit the equivalence of 2 gadgets via developing an appropriate bisimulation relation among them. This selection of surveys is aimed toward either researchers and Master's scholars in machine technology and arithmetic and bargains with numerous points of bisimulation and coinduction, with an emphasis on method thought. Seven chapters hide the next themes: background, algebra and coalgebra, algorithmics, common sense, higher-order languages, improvements of the bisimulation facts technique, and possibilities. workouts also are incorporated to assist the reader grasp new material.
Contents: 1. Origins of bisimulation and coinduction (Davide Sangiorgi) — 2. An creation to (co)algebra and (co)induction (Bart Jacobs and Jan Rutten) — three. The algorithmics of bisimilarity (Luca Aceto, Anna Ingolfsdottir and Jiří Srba) — four. Bisimulation and good judgment (Colin Stirling) — five. Howe’s procedure for higher-order languages (Andrew Pitts) — 6. improvements of the bisimulation evidence technique (Damien Pous and Davide Sangiorgi) — 7. Probabilistic bisimulation (Prakash Panangaden)
Read or Download Advanced Topics in Bisimulation and Coinduction PDF
Best machine theory books
New version of the vintage discrete arithmetic textual content for laptop technological know-how majors.
Organizational cognition matters the procedures which supply brokers and enterprises being able to study, make judgements, and resolve difficulties. Organizational and Technological Implications of Cognitive Machines: Designing destiny details administration platforms offers new demanding situations and views to the certainty of the participation of cognitive machines in firms.
The two-volume set LNCS 5592 and 5593 constitutes the refereed court cases of the overseas convention on Computational technological know-how and Its purposes, ICCSA 2009, held in Seoul, Korea, in June/July, 2009. the 2 volumes comprise papers providing a wealth of unique study ends up in the sphere of computational technological know-how, from foundational matters in computing device technological know-how and arithmetic to complex purposes in almost all sciences employing computational options.
Common codes successfully compress sequences generated through desk bound and ergodic resources with unknown records, and so they have been initially designed for lossless info compression. meanwhile, it used to be discovered that they are often used for fixing vital difficulties of prediction and statistical research of time sequence, and this ebook describes fresh leads to this sector.
- Interactive Theorem Proving and Program Development: Coq’Art: The Calculus of Inductive Constructions
- The Theory of Linear Prediction
- 50 Years of Artificial Intelligence - Essays Dedicated to the 50th Anniversary of Artificial Intelligence
- Mastering Machine Learning with R
- More Playful User Interfaces: Interfaces that Invite Social and Physical Interaction
- Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks
Additional info for Advanced Topics in Bisimulation and Coinduction
Towards a mathematical science of computation. In Proceedings of IFIP Congress 62, pages 21–28. North-Holland, 1963. [Mil70] R. Milner. A formal notion of simulation between programs. Memo 14, Computers and Logic Research Group, University College of Swansea, UK, 1970. [Mil71a] R. Milner. Program simulation: an extended formal notion. Memo 17, Computers and Logic Research Group, University College of Swansea, UK, 1971. [Mil71b] R. Milner. An algebraic definition of simulation between programs. In Proceedings of the 2nd International Joint Conferences on Artificial Intelligence.
In M. Nivat, editor, Proceedings of the IRIA Symposium on Automata, Languages and Programming, Paris, France, July, 1972, pages 225–251. North-Holland, 1973. A. Huffman. The synthesis of sequential switching circuits. Journal of the Franklin Institute (Mar. 1954) and (Apr. 1954), 257(3–4):161–190 and 275–303, 1954. [Imm82] N. Immerman. Upper and lower bounds for first order expressibility. Journal of Computer and System Science, 25(1):76–98, 1982. [Jen80] K. Jensen. A method to compare the descriptive power of different types of petri nets.
Mathematische Annalen, 86:230–237, 1922. [Fra53] R. Fra¨ıss´e. Sur quelques classifications des syst`emes de relations. PhD thesis, University of Paris, 1953. Also in Publications Scientifiques de l’Universit´e d’Alger, series A, 1, 35–182, 1954. [Fri73] H. Friedman. The consistency of classical set theory relative to a set theory with intuitionistic logic. Journal of Symbolic Logic, 38:315–319, 1973. [Gin68] A. Ginzburg. Algebraic Theory of Automata. Academic Press, 1968. J. van Glabbeek. The linear time-branching time spectrum (extended abstract).
Advanced Topics in Bisimulation and Coinduction by Davide Sangiorgi, Jan Rutten