Rational series and their languages
Rational series and their languages
Bisimulation through probabilistic testing
Information and Computation
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Concrete Math
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Category Theory and Computer Science
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Generalised coinduction
Automata and coinduction (an exercise in coalgebra)
Automata and coinduction (an exercise in coalgebra)
Automata, power series, and coinduction: taking input derivatives seriously (extended abstract)
Automata, power series, and coinduction: taking input derivatives seriously (extended abstract)
Coalgebra, concurrency, and control
Coalgebra, concurrency, and control
Journal of Functional Programming
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
Distributive laws for the coinductive solution of recursive equations
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Automata and fixed point logic: a coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Processes as formal power series: a coinductive approach to denotational semantics
Theoretical Computer Science
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
Functional pearl: streams and unique fixed points
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Coinductive Properties of Causal Maps
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Using coalgebra and coinduction to define ontology-based multi-agent systems
International Journal of Metadata, Semantics and Ontologies
(Bi)simulations up-to characterise process semantics
Information and Computation
Weighted Bisimulation in Linear Algebraic Form
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Journal of Functional Programming
Productivity of stream definitions
Theoretical Computer Science
Circular Coinduction with Special Contexts
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Relating Two Approaches to Coinductive Solution of Recursive Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata and Fixed Point Logics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributive laws for the coinductive solution of recursive equations
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Automata and fixed point logic: A coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
A coinductive calculus of binary trees
Information and Computation
Behavioural differential equations and coinduction for binary trees
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Coalgebraic foundations of linear systems
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Coinduction in Concurrent Timed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Subsequential transducers: a coalgebraic perspective
Information and Computation
Proceedings of the sixth workshop on Declarative aspects of multicore programming
CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
Concrete stream calculus: An extended study
Journal of Functional Programming
Pointwise extensions of gsos-defined operations
Mathematical Structures in Computer Science
From grammars and automata to algebras and coalgebras
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Proving the unique fixed-point principle correct: an adventure with category theory
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Context-free languages, coalgebraically
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Scans and convolutions: a calculational proof of Moessner's theorem
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Formal modeling
The essence of dataflow programming
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
A coalgebraic perspective on linear weighted automata
Information and Computation
Look: simple stochastic relations are just, well, simple
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Context-free languages via coalgebraic trace semantics
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Testing semantics: connecting processes and process logics
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
On the complexity of equivalence of specifications of infinite objects
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Productivity of stream definitions
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
ACM Transactions on Computational Logic (TOCL)
Stream processing coalgebraically
Science of Computer Programming
Hi-index | 5.23 |
We present a theory of streams (infinite sequences), automata and languages, and formal power series, in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This coalgebraic perspective leads to a unified theory, in which the observation that each of the aforementioned sets carries a so-called final automaton structure, plays a central role. Finality forms the basis for both definitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive definitions take the shape of what we have called behavioural differential equations, after Brzozowski's notion of input derivative. A calculus is developed for coinductive reasoning about all of the afore mentioned structures, closely resembling calculus from classical analysis.