Jan Rutten

NII Shonan Meet. Rep., 2017

Enhanced coalgebraic bisimulation.

[BibT_eX]

[DOI]

Damien Pous

Math. Struct. Comput. Sci., 2017

Stream Differential Equations: Specification Formats and Solution Methods.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

2016

A coalgebraic view on decorated traces.

[BibT_eX]

[DOI]

Georgiana Caltais

Math. Struct. Comput. Sci., 2016

Proving language inclusion and equivalence by coinduction.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Errata to "Formations of Monoids, Congruences, and Formal Languages".

[BibT_eX]

[DOI]

Ramon Esteban-Romero

Sci. Ann. Comput. Sci., 2016

2015

Context-free coalgebras.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

The dual equivalence of equations and coequations for automata.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Formations of Monoids, Congruences, and Formal Languages.

[BibT_eX]

[DOI]

Ramon Esteban-Romero

Sci. Ann. Comput. Sci., 2015

Regular Varieties of Automata and Coequations.

[BibT_eX]

[DOI]

Julian Salamanca

Proceedings of the Mathematics of Program Construction - 12th International Conference, 2015

Equations and Coequations for Weighted Automata.

[BibT_eX]

[DOI]

Julian Salamanca

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Newton Series, Coinductively.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

2014

Algebra-coalgebra duality in Brzozowski's minimization algorithm.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2014

Coalgebraic Semantics of Heavy-Weighted Automata.

[BibT_eX]

[DOI]

Marie Fortin

Proceedings of the Recent Trends in Algebraic Development Techniques, 2014

A Coalgebraic Foundation for Coinductive Union Types.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

A Final Coalgebra for k-regular Sequences.

[BibT_eX]

[DOI]

Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

(Co)Algebraic Characterizations of Signal Flow Graphs.

[BibT_eX]

[DOI]

Henning Basold

Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013

Stream processing coalgebraically.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2013

Automatic equivalence proofs for non-deterministic coalgebras.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2013

Varieties and Covarieties of Languages (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Obituary for Jaco de Bakker, 1939-2012.

[BibT_eX]

[DOI]

Jan A. Bergstra

Jan Willem Klop

Bull. EATCS, 2013

Generalizing determinization from automata to coalgebras

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Coalgebraic Characterizations of Context-Free Languages.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Coalgebraic Bisimulation-Up-To.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Coinductive Proof Techniques for Language Equivalence.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2013

2012

Connectors as designs: Modeling, refinement and test case generation.

[BibT_eX]

[DOI]

Sun Meng

Farhad Arbab

Bernhard K. Aichernig

Lacramioara Astefanoaei

Frank S. de Boer

Sci. Comput. Program., 2012

A coalgebraic perspective on linear weighted automata.

[BibT_eX]

[DOI]

Michele Boreale

Inf. Comput., 2012

Final Semantics for Decorated Traces.

[BibT_eX]

[DOI]

Georgiana Caltais

Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Defining Context-Free Power Series Coalgebraically.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

On the Final Coalgebra of Automatic Sequences.

[BibT_eX]

[DOI]

Proceedings of the Logic and Program Semantics, 2012

Brzozowski's Algorithm (Co)Algebraically.

[BibT_eX]

[DOI]

Proceedings of the Logic and Program Semantics, 2012

An introduction to (co)algebra and (co)induction.

[BibT_eX]

Bart Jacobs

Proceedings of the Advanced Topics in Bisimulation and Coinduction., 2012

2011

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A proof of Moessner's theorem by coinduction.

[BibT_eX]

[DOI]

High. Order Symb. Comput., 2011

Quantitative Kleene coalgebras.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Intentional Automata: A Context-Dependent Model for Component Connectors - (Extended Abstract).

[BibT_eX]

[DOI]

David Costa

Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

Context-Free Languages, Coalgebraically.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010

A coinductive calculus of binary trees.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Complete sets of cooperations.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions.

[BibT_eX]

[DOI]

Sci. Ann. Comput. Sci., 2010

Non-Deterministic Kleene Coalgebras

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

A Decision Procedure for Bisimilarity of Generalized Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods: Foundations and Applications, 2010

Sampling, Splitting and Merging in Coinductive Stream Calculus.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Program Construction, 10th International Conference, 2010

Generalizing the powerset construction, coalgebraically.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

Fault-Based Test Case Generation for Component Connectors.

[BibT_eX]

[DOI]

Bernhard K. Aichernig

Farhad Arbab

Lacramioara Astefanoaei

Frank S. de Boer

Sun Meng

Proceedings of the TASE 2009, 2009

An Algebra for Kripke Polynomial Coalgebras.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

A Kleene Theorem for Polynomial Coalgebras.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2009

Coinductive Predicates as Final Coalgebras.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

Deriving Syntax and Axioms for Quantitative Regular Behaviours.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Rational Streams Coalgebraically.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

Observational Coalgebras and Complete Sets of Co-operations.

[BibT_eX]

[DOI]

Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science, 2008

Coalgebraic Logic and Synthesis of Mealy Machines.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2008

A Roman Senator.

[BibT_eX]

[DOI]

Proceedings of the Concurrency, 2008

2007

Models and temporal logical specifications for timed component connectors.

[BibT_eX]

[DOI]

Softw. Syst. Model., 2007

Behavioural Differential Equations and Coinduction for Binary Trees.

[BibT_eX]

[DOI]

Proceedings of the Logic, 2007

Coalgebraic Foundations of Linear Systems.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006

Preface.

[BibT_eX]

[DOI]

José Luiz Fiadeiro

Theor. Comput. Sci., 2006

Modeling component connectors in Reo by constraint automata.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2006

Synthesis of Mealy Machines Using Derivatives.

[BibT_eX]

[DOI]

David Costa

Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science, 2006

2005

A tutorial on coinductive stream calculus and signal flow graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A coinductive calculus of streams.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2005

Algebraic Specification and Coalgebraic Synthesis of Mealy Automata.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Formal Aspects of Component Software, 2005

Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications.

[BibT_eX]

[DOI]

Proceedings of the Coordination Models and Languages, 7th International Conference, 2005

2004

Models and Temporal Logics for Timed Component Connectors.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on Software Engineering and Formal Methods (SEFM 2004), 2004

Mathematical techniques for analyzing concurrent and probabilistic systems.

[BibT_eX]

[DOI]

CRM monograph series 23, American Mathematical Society, ISBN: 978-0-8218-3571-5, 2004

2003

Behavioural differential equations: a coinductive calculus of streams, automata, and power series.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Coinductive Counting with Weighted Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of FOCLASA 2003, 2003

An Application of Stream Calculus to Signal Flow Graphs.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Components and Objects, 2003

2002

Coalgebraic Methods in Computer Science - Foreword.

[BibT_eX]

[DOI]

Bart Jacobs

Theor. Comput. Sci., 2002

Coinductive Counting: Bisimulation in Enumerative Combinatorics.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2002

A Coinductive Calculus of Component Connectors.

[BibT_eX]

[DOI]

Farhad Arbab

Proceedings of the Recent Trends in Algebraic Development Techniques, 2002

2001

Foreword : Coalgebraic Methods in Computer Science 1998.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Elements of Stream Calculus (An Extensive Exercise in Coinduction).

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

2000

Universal coalgebra: a theory of systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

A transition system semantics for the control-driven coordination language MANIFOLD.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Program Construction, 5th International Conference, 2000

1999

Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach.

[BibT_eX]

[DOI]

Erik P. de Vink

Theor. Comput. Sci., 1999

A note on coinduction and weak bisimilarity for while programs.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1999

Preface.

[BibT_eX]

[DOI]

Bart Jacobs

Proceedings of the Coalgebraic Methods in Computer Science, 1999

Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding.

[BibT_eX]

[DOI]

Franck van Breugel

Theor. Comput. Sci., 1998

On the Foundations of Final Coalgebra Semantics.

[BibT_eX]

Daniele Turi

Math. Struct. Comput. Sci., 1998

Relators and Metric Bisimulations.

[BibT_eX]

[DOI]

Proceedings of the First Workshop on Coalgebraic Methods in Computer Science, 1998

Preface.

[BibT_eX]

[DOI]

Proceedings of the First Workshop on Coalgebraic Methods in Computer Science, 1998

Automata and Coinduction (An Exercise in Coalgebra).

[BibT_eX]

[DOI]

Proceedings of the CONCUR '98: Concurrency Theory, 1998

1996

Elements of Generalized Ultrametric Domain Theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

1995

Solutions of functorial and non-functorial metric domain equations.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

1994

Fully Abstract Denotational Models for Nonuniform Concurrent Languages

[BibT_eX]

[DOI]

Eiichi Horita

J. W. de Bakker

Inf. Comput., November, 1994

1993

Non-monotonic Concurrent Constraint Programming.

[BibT_eX]

Proceedings of the Logic Programming, 1993

Initial Algebra and Final Coalgebra Semantics for Concurrency.

[BibT_eX]

[DOI]

Daniele Turi

Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

A Strucutral Co-Induction Theorem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992

From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Processes as Terms: Non-Well-Founded Models for Bisimulation.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1992

A semantic approach to fairness.

[BibT_eX]

Jeffery I. Zucker

Fundam. Informaticae, 1992

A Layered Semantics for a Parallel Object-Oriented Language.

[BibT_eX]

[DOI]

Pierre America

Formal Aspects Comput., 1992

On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders.

[BibT_eX]

[DOI]

Daniele Turi

Proceedings of the Sematics: Foundations and Applications, 1992

On Blocks: Locality and Asynchronous Communication (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sematics: Foundations and Applications, 1992

1991

Semantic Models for Concurrent Logic Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Nonwellfounded Sets and Programming Language Semantics.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1991

The Failure of Failures in a Paradigm for Asynchronous Communication.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '91, 1991

1990

Contractions in Comparing Concurrency Semantics.

[BibT_eX]

[DOI]

Joost N. Kok

Theor. Comput. Sci., 1990

Semantic Correctness for a Parallel Object-Oriented Language.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Deriving Denotational Models for Bisimulation from Structured Operational Semantics.

[BibT_eX]

Proceedings of the Programming concepts and methods: Proceedings of the IFIP Working Group 2.2, 1990

1989

Denotational Semantics of a Parallel Object-Oriented Language

[BibT_eX]

[DOI]

Inf. Comput., November, 1989

Solving Reflexive Domain Equations in a Category of Complete Metric Spaces.

[BibT_eX]

[DOI]

Pierre America

J. Comput. Syst. Sci., 1989

Control Flow versus Logic: A Denotational and a Declarative Model for Guarded Horn Clauses.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Semantic Models for a Version of PARLOG.

[BibT_eX]

Proceedings of the Logic Programming, 1989

1988

Correctness and full abstraction of metric semantics for concurrency.

[BibT_eX]

[DOI]

Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

Contractions in Comparing Concurrent Semantics.

[BibT_eX]

[DOI]

Joost N. Kok