[PDF][PDF] The Method of Coalgebra: exercises in coinduction
J Rutten - 2019 - core.ac.uk
The Method of Coalgebra: exercises in coinduction Jan Rutten Page 1 The Method of
Coalgebra: exercises in coinduction Jan Rutten February 2019 261 pages ISBN 978-90-6196-568-8 …
Coalgebra: exercises in coinduction Jan Rutten February 2019 261 pages ISBN 978-90-6196-568-8 …
A general account of coinduction up-to
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient
proof techniques for checking properties of different kinds of systems. We prove the …
proof techniques for checking properties of different kinds of systems. We prove the …
Coinduction up-to in a fibrational setting
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient
proof techniques for checking properties of different kinds of systems. We prove the …
proof techniques for checking properties of different kinds of systems. We prove the …
Algebra-coalgebra duality in Brzozowski's minimization algorithm
We give a new presentation of Brzozowski's algorithm to minimize finite automata using
elementary facts from universal algebra and coalgebra and building on earlier work by Arbib …
elementary facts from universal algebra and coalgebra and building on earlier work by Arbib …
[PDF][PDF] Stream differential equations: specification formats and solution methods
Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich
theory partly due to their ubiquity in mathematics and computer science. Stream differential …
theory partly due to their ubiquity in mathematics and computer science. Stream differential …
Algebra, coalgebra, and minimization in polynomial differential equations
M Boreale - Logical Methods in Computer Science, 2019 - lmcs.episciences.org
We consider reasoning and minimization in systems of polynomial ordinary differential
equations (ode's). The ring of multivariate polynomials is employed as a syntax for denoting …
equations (ode's). The ring of multivariate polynomials is employed as a syntax for denoting …
[HTML][HTML] Complete algorithms for algebraic strongest postconditions and weakest preconditions in polynomial odes
M Boreale - Science of Computer Programming, 2020 - Elsevier
A system of polynomial ordinary differential equations (ode s) is specified via a vector of
multivariate polynomials, or vector field, F. A safety assertion ψ⟶[F] ϕ means that the …
multivariate polynomials, or vector field, F. A safety assertion ψ⟶[F] ϕ means that the …
Coalgebraic bisimulation-up-to
Bisimulation-up-to enhances the bisimulation proof method for process equivalence. We
present its generalization from labelled transition systems to arbitrary coalgebras, and show …
present its generalization from labelled transition systems to arbitrary coalgebras, and show …
Minimization via duality
N Bezhanishvili, C Kupke, P Panangaden - International Workshop on …, 2012 - Springer
We show how to use duality theory to construct minimized versions of a wide class of
automata. We work out three cases in detail:(a variant of) ordinary automata, weighted …
automata. We work out three cases in detail:(a variant of) ordinary automata, weighted …
A canonical form for weighted automata and applications to approximate minimization
B Balle, P Panangaden… - 2015 30th Annual ACM …, 2015 - ieeexplore.ieee.org
We study the problem of constructing approximations to a weighted automaton. Weighted
finite automata (WFA) are closely related to the theory of rational series. A rational series is a …
finite automata (WFA) are closely related to the theory of rational series. A rational series is a …