Operational Semantics of a Parallel Object-Oriented Language. - Pierre America; Jaco de Bakker; Joost N. Kok; Jan J. M. M. Rutten (POPL, 1986)

Contractions in Comparing Concurrent Semantics. - Joost N. Kok; Jan J. M. M. Rutten (ICALP, 1988)

Correctness and full abstraction of metric semantics for concurrency. - Jan J. M. M. Rutten (REX Workshop, 1988)

Semantic Models for a Version of PARLOG. - Frank S. de Boer; Joost N. Kok; Catuscia Palamidessi; Jan J. M. M. Rutten (ICLP, 1989)

Control Flow versus Logic: A Denotational and a Declarative Model for Guarded Horn Clauses. - Frank S. de Boer; Joost N. Kok; Catuscia Palamidessi; Jan J. M. M. Rutten (MFCS, 1989)

Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. - Pierre America; Jan J. M. M. Rutten (J. Comput. Syst. Sci., 1989)

Denotational Semantics of a Parallel Object-Oriented Language - Pierre America; Jaco de Bakker; Joost N. Kok; Jan J. M. M. Rutten (Inf. Comput., 1989)

Deriving Denotational Models for Bisimulation from Structured Operational Semantics. - Jan J. M. M. Rutten (Programming Concepts and Methods, 1990)

Semantic Correctness for a Parallel Object-Oriented Language. - Jan J. M. M. Rutten (SIAM J. Comput., 1990)

Contractions in Comparing Concurrency Semantics. - Joost N. Kok; Jan J. M. M. Rutten (Theor. Comput. Sci., 1990)

The Failure of Failures in a Paradigm for Asynchronous Communication. - Frank S. de Boer; Joost N. Kok; Catuscia Palamidessi; Jan J. M. M. Rutten (CONCUR, 1991)

Nonwellfounded Sets and Programming Language Semantics. - Jan J. M. M. Rutten (MFPS, 1991)

Semantic Models for Concurrent Logic Languages. - Frank S. de Boer; Jan J. M. M. Rutten; Joost N. Kok; Catuscia Palamidessi (Theor. Comput. Sci., 1991)

On Blocks: Locality and Asynchronous Communication (Extended Abstract). - Frank S. de Boer; Joost N. Kok; Catuscia Palamidessi; Jan J. M. M. Rutten (REX Workshop, 1992)

On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders. - Jan J. M. M. Rutten; Daniele Turi (REX Workshop, 1992)

A Layered Semantics for a Parallel Object-Oriented Language. - Pierre America; Jan J. M. M. Rutten (Formal Aspects Comput., 1992)

A semantic approach to fairness. - Jan J. M. M. Rutten; Jeffery I. Zucker (Fundam. Informaticae, 1992)

Processes as Terms: Non-Well-Founded Models for Bisimulation. - Jan J. M. M. Rutten (Math. Struct. Comput. Sci., 1992)

From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic. - Frank S. de Boer; Joost N. Kok; Catuscia Palamidessi; Jan J. M. M. Rutten (Theor. Comput. Sci., 1992)

A Strucutral Co-Induction Theorem. - Jan J. M. M. Rutten (MFPS, 1993)

Initial Algebra and Final Coalgebra Semantics for Concurrency. - Jan J. M. M. Rutten; Daniele Turi (REX School/Symposium, 1993)

Non-monotonic Concurrent Constraint Programming. - Frank S. de Boer; Joost N. Kok; Catuscia Palamidessi; Jan J. M. M. Rutten (ILPS, 1993)

Fully Abstract Denotational Models for Nonuniform Concurrent Languages - Eiichi Horita; J. W. de Bakker; Jan J. M. M. Rutten (Inf. Comput., 1994)

Solutions of functorial and non-functorial metric domain equations. - Fabio Alessi; Paolo Baldan; Gianna Bellè; Jan J. M. M. Rutten (MFPS, 1995)

Elements of Generalized Ultrametric Domain Theory. - Jan J. M. M. Rutten (Theor. Comput. Sci., 1996)

Automata and Coinduction (An Exercise in Coalgebra). - Jan J. M. M. Rutten (CONCUR, 1998)

Preface. - Bart Jacobs 001; Larry Moss; Horst Reichel; Jan J. M. M. Rutten (CMCS, 1998)

Relators and Metric Bisimulations. - Jan J. M. M. Rutten (CMCS, 1998)

On the Foundations of Final Coalgebra Semantics. - Daniele Turi; Jan J. M. M. Rutten (Math. Struct. Comput. Sci., 1998)

Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding. - Marcello M. Bonsangue; Franck van Breugel; Jan J. M. M. Rutten (Theor. Comput. Sci., 1998)

Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously. - Jan J. M. M. Rutten (ICALP, 1999)

Preface. - Bart Jacobs 001; Jan J. M. M. Rutten (CMCS, 1999)

A note on coinduction and weak bisimilarity for while programs. - Jan J. M. M. Rutten (RAIRO Theor. Informatics Appl., 1999)

Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. - Erik P. de Vink; Jan J. M. M. Rutten (Theor. Comput. Sci., 1999)

Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series. - Jan J. M. M. Rutten (MPC, 2000)

A transition system semantics for the control-driven coordination language MANIFOLD. - Marcello M. Bonsangue; Farhad Arbab; J. W. de Bakker; Jan J. M. M. Rutten; A. Secutella; Gianluigi Zavattaro (Theor. Comput. Sci., 2000)

Universal coalgebra: a theory of systems. - Jan J. M. M. Rutten (Theor. Comput. Sci., 2000)

Elements of Stream Calculus (An Extensive Exercise in Coinduction). - Jan J. M. M. Rutten (MFPS, 2001)

Foreword : Coalgebraic Methods in Computer Science 1998. - Bart Jacobs 001; Larry Moss; Horst Reichel; Jan J. M. M. Rutten (Theor. Comput. Sci., 2001)

A Coinductive Calculus of Component Connectors. - Farhad Arbab; Jan J. M. M. Rutten (WADT, 2002)

Coinductive Counting: Bisimulation in Enumerative Combinatorics. - Jan J. M. M. Rutten (CMCS, 2002)

Coalgebraic Methods in Computer Science - Foreword. - Bart Jacobs 001; Jan J. M. M. Rutten (Theor. Comput. Sci., 2002)

An Application of Stream Calculus to Signal Flow Graphs. - Jan J. M. M. Rutten (FMCO, 2003)

Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract). - Farhad Arbab; Christel Baier; Jan J. M. M. Rutten; Marjan Sirjani (FOCLASA, 2003)

Coinductive Counting with Weighted Automata. - Jan J. M. M. Rutten (J. Autom. Lang. Comb., 2003)

Behavioural differential equations: a coinductive calculus of streams, automata, and power series. - Jan J. M. M. Rutten (Theor. Comput. Sci., 2003)

Mathematical techniques for analyzing concurrent and probabilistic systems. - Jan J. M. M. Rutten; Marta Z. Kwiatkowska; Gethin Norman; David Parker 001; Prakash Panangaden (American Mathematical Society, 2004)

Models and Temporal Logics for Timed Component Connectors. - Farhad Arbab; Christel Baier; Frank S. de Boer; Jan J. M. M. Rutten (SEFM, 2004)

Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications. - Farhad Arbab; Christel Baier; Frank S. de Boer; Jan J. M. M. Rutten; Marjan Sirjani (COORDINATION, 2005)

Algebraic Specification and Coalgebraic Synthesis of Mealy Automata. - Jan J. M. M. Rutten (FACS, 2005)

A coinductive calculus of streams. - Jan J. M. M. Rutten (Math. Struct. Comput. Sci., 2005)

A tutorial on coinductive stream calculus and signal flow graphs. - Jan J. M. M. Rutten (Theor. Comput. Sci., 2005)

Synthesis of Mealy Machines Using Derivatives. - Helle Hvid Hansen; David Costa 001; Jan J. M. M. Rutten (CMCS, 2006)

Modeling component connectors in Reo by constraint automata. - Christel Baier; Marjan Sirjani; Farhad Arbab; Jan J. M. M. Rutten (Sci. Comput. Program., 2006)

Preface. - José Luiz Fiadeiro; Jan J. M. M. Rutten (Theor. Comput. Sci., 2006)

Coalgebraic Foundations of Linear Systems. - Jan J. M. M. Rutten (CALCO, 2007)

Behavioural Differential Equations and Coinduction for Binary Trees. - Alexandra Silva 001; Jan J. M. M. Rutten (WoLLIC, 2007)

Models and temporal logical specifications for timed component connectors. - Farhad Arbab; Christel Baier; Frank S. de Boer; Jan J. M. M. Rutten (Softw. Syst. Model., 2007)

A Roman Senator. - Jan J. M. M. Rutten (Concurrency, Graphs and Models, 2008)

Coalgebraic Logic and Synthesis of Mealy Machines. - Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (FoSSaCS, 2008)

Observational Coalgebras and Complete Sets of Co-operations. - Clemens Kupke; Jan J. M. M. Rutten (CMCS, 2008)

Rational Streams Coalgebraically. - Jan J. M. M. Rutten (Log. Methods Comput. Sci., 2008)

Deriving Syntax and Axioms for Quantitative Regular Behaviours. - Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (CONCUR, 2009)

Coinductive Predicates as Final Coalgebras. - Milad Niqui; Jan Rutten (FICS, 2009)

A Kleene Theorem for Polynomial Coalgebras. - Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (FoSSaCS, 2009)

An Algebra for Kripke Polynomial Coalgebras. - Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (LICS, 2009)

Fault-Based Test Case Generation for Component Connectors. - Bernhard K. Aichernig; Farhad Arbab; Lacramioara Astefanoaei; Frank S. de Boer; Sun Meng; Jan J. M. M. Rutten (TASE, 2009)

Generalizing the powerset construction, coalgebraically. - Alexandra Silva 001; Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten (FSTTCS, 2010)

Sampling, Splitting and Merging in Coinductive Stream Calculus. - Milad Niqui; Jan J. M. M. Rutten (MPC, 2010)

A Decision Procedure for Bisimilarity of Generalized Regular Expressions. - Marcello M. Bonsangue; Georgiana Caltais; Eugen-Ioan Goriac; Dorel Lucanu; Jan J. M. M. Rutten; Alexandra Silva 001 (SBMF, 2010)

Non-Deterministic Kleene Coalgebras - Alexandra Silva 001; Marcello M. Bonsangue; Jan J. M. M. Rutten (Log. Methods Comput. Sci., 2010)

Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions. - Helle Hvid Hansen; Jan J. M. M. Rutten (Sci. Ann. Comput. Sci., 2010)

Complete sets of cooperations. - Clemens Kupke; Jan J. M. M. Rutten (Inf. Comput., 2010)

A coinductive calculus of binary trees. - Alexandra Silva 001; Jan J. M. M. Rutten (Inf. Comput., 2010)

Context-Free Languages, Coalgebraically. - Joost Winter; Marcello M. Bonsangue; Jan J. M. M. Rutten (CALCO, 2011)

Intentional Automata: A Context-Dependent Model for Component Connectors - (Extended Abstract). - David Costa 001; Milad Niqui; Jan J. M. M. Rutten (FSEN, 2011)

Quantitative Kleene coalgebras. - Alexandra Silva 001; Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten (Inf. Comput., 2011)

A proof of Moessner's theorem by coinduction. - Milad Niqui; Jan J. M. M. Rutten (High. Order Symb. Comput., 2011)

Preface. - Bart Jacobs 001; Milad Niqui; Jan J. M. M. Rutten; Alexandra Silva 001 (Theor. Comput. Sci., 2011)

An introduction to (co)algebra and (co)induction. - Bart Jacobs 001; Jan Rutten (Advanced Topics in Bisimulation and Coinduction, 2012)

Brzozowski's Algorithm (Co)Algebraically. - Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (Logic and Program Semantics, 2012)

On the Final Coalgebra of Automatic Sequences. - Clemens Kupke; Jan J. M. M. Rutten (Logic and Program Semantics, 2012)

Defining Context-Free Power Series Coalgebraically. - Marcello M. Bonsangue; Jan J. M. M. Rutten; Joost Winter (CMCS, 2012)

Final Semantics for Decorated Traces. - Filippo Bonchi; Marcello M. Bonsangue; Georgiana Caltais; Jan J. M. M. Rutten; Alexandra Silva 001 (MFPS, 2012)

A coalgebraic perspective on linear weighted automata. - Filippo Bonchi; Marcello M. Bonsangue; Michele Boreale; Jan J. M. M. Rutten; Alexandra Silva 001 (Inf. Comput., 2012)

Connectors as designs: Modeling, refinement and test case generation. - Sun Meng; Farhad Arbab; Bernhard K. Aichernig; Lacramioara Astefanoaei; Frank S. de Boer; Jan J. M. M. Rutten (Sci. Comput. Program., 2012)

Coinductive Proof Techniques for Language Equivalence. - Jurriaan Rot; Marcello M. Bonsangue; Jan J. M. M. Rutten (LATA, 2013)

Coalgebraic Bisimulation-Up-To. - Jurriaan Rot; Marcello M. Bonsangue; Jan J. M. M. Rutten (SOFSEM, 2013)

Coalgebraic Characterizations of Context-Free Languages. - Joost Winter; Marcello M. Bonsangue; Jan J. M. M. Rutten (Log. Methods Comput. Sci., 2013)

Generalizing determinization from automata to coalgebras - Alexandra Silva 001; Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten (Log. Methods Comput. Sci., 2013)

Obituary for Jaco de Bakker, 1939-2012. - Jan A. Bergstra; Jan Willem Klop; Jan Rutten (Bull. EATCS, 2013)

Varieties and Covarieties of Languages (Extended Abstract). - Jan Rutten; Adolfo Ballester-Bolinches; Enric Cosme-Llópez (MFPS, 2013)

Automatic equivalence proofs for non-deterministic coalgebras. - Marcello M. Bonsangue; Georgiana Caltais; Eugen-Ioan Goriac; Dorel Lucanu; Jan J. M. M. Rutten; Alexandra Silva 001 (Sci. Comput. Program., 2013)

Stream processing coalgebraically. - Milad Niqui; Jan J. M. M. Rutten (Sci. Comput. Program., 2013)

(Co)Algebraic Characterizations of Signal Flow Graphs. - Henning Basold; Marcello M. Bonsangue; Helle Hvid Hansen; Jan Rutten (Horizons of the Mind, 2014)

A Final Coalgebra for k-regular Sequences. - Helle Hvid Hansen; Clemens Kupke; Jan Rutten; Joost Winter (Horizons of the Mind, 2014)

A Coalgebraic Foundation for Coinductive Union Types. - Marcello M. Bonsangue; Jurriaan Rot; Davide Ancona; Frank S. de Boer; Jan J. M. M. Rutten (ICALP (2), 2014)

Coalgebraic Semantics of Heavy-Weighted Automata. - Marie Fortin; Marcello M. Bonsangue; Jan Rutten (WADT, 2014)

Algebra-coalgebra duality in Brzozowski's minimization algorithm. - Filippo Bonchi; Marcello M. Bonsangue; Helle Hvid Hansen; Prakash Panangaden; Jan J. M. M. Rutten; Alexandra Silva 001 (ACM Trans. Comput. Log., 2014)

Newton Series, Coinductively. - Henning Basold; Helle Hvid Hansen; Jean-Éric Pin; Jan Rutten (ICTAC, 2015)

Equations and Coequations for Weighted Automata. - Julian Salamanca; Marcello M. Bonsangue; Jan J. M. M. Rutten (MFCS (1), 2015)

Regular Varieties of Automata and Coequations. - Julian Salamanca; Adolfo Ballester-Bolinches; Marcello M. Bonsangue; Enric Cosme-Llópez; Jan J. M. M. Rutten (MPC, 2015)

Formations of Monoids, Congruences, and Formal Languages. - Adolfo Ballester-Bolinches; Enric Cosme-Llópez; Ramon Esteban-Romero; Jan J. M. M. Rutten (Sci. Ann. Comput. Sci., 2015)

The dual equivalence of equations and coequations for automata. - Adolfo Ballester-Bolinches; Enric Cosme-Llópez; Jan J. M. M. Rutten (Inf. Comput., 2015)

Context-free coalgebras. - Joost Winter; Marcello M. Bonsangue; Jan J. M. M. Rutten (J. Comput. Syst. Sci., 2015)

Errata to "Formations of Monoids, Congruences, and Formal Languages". - Adolfo Ballester-Bolinches; Enric Cosme-Llópez; Ramon Esteban-Romero; Jan J. M. M. Rutten (Sci. Ann. Comput. Sci., 2016)

Proving language inclusion and equivalence by coinduction. - Jurriaan Rot; Marcello M. Bonsangue; Jan Rutten (Inf. Comput., 2016)

A coalgebraic view on decorated traces. - Filippo Bonchi; Marcello M. Bonsangue; Georgiana Caltais; Jan Rutten; Alexandra Silva 001 (Math. Struct. Comput. Sci., 2016)

Stream Differential Equations: Specification Formats and Solution Methods. - Helle Hvid Hansen; Clemens Kupke; Jan Rutten (Log. Methods Comput. Sci., 2017)

Enhanced coalgebraic bisimulation. - Jurriaan Rot; Filippo Bonchi; Marcello M. Bonsangue; Damien Pous; Jan Rutten; Alexandra Silva 001 (Math. Struct. Comput. Sci., 2017)

Enhanced coinduction (NII Shonan Meeting 2017-17). - Shin-ya Katsumata; Damien Pous; Jan Rutten (NII Shonan Meet. Rep., 2017)

Newton series, coinductively: a comparative study of composition. - Henning Basold; Helle Hvid Hansen; Jean-Éric Pin; Jan Rutten (Math. Struct. Comput. Sci., 2019)