Jan J. M. M. Rutten

Publication Activity (10 Years)

Years Active: 1986-2016
Publications (10 Years): 6

Top Venues

Sci. Comput. Program.

Logic and Program Semantics

Inf. Comput.

Sci. Ann. Comput. Sci.

Publications

Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Ramon Esteban-Romero, Jan J. M. M. Rutten
Errata to "Formations of Monoids, Congruences, and Formal Languages". Sci. Ann. Comput. Sci. 26 (1) (2016)
Julian Salamanca, Adolfo Ballester-Bolinches, Marcello M. Bonsangue, Enric Cosme-Llópez, Jan J. M. M. Rutten
Regular Varieties of Automata and Coequations. MPC (2015)
Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Jan J. M. M. Rutten
The dual equivalence of equations and coequations for automata. Inf. Comput. 244 (2015)
Joost Winter, Marcello M. Bonsangue, Jan J. M. M. Rutten
Context-free coalgebras. J. Comput. Syst. Sci. 81 (5) (2015)
Julian Salamanca, Marcello M. Bonsangue, Jan J. M. M. Rutten
Equations and Coequations for Weighted Automata. MFCS (1) (2015)
Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Ramon Esteban-Romero, Jan J. M. M. Rutten
Formations of Monoids, Congruences, and Formal Languages. Sci. Ann. Comput. Sci. 25 (2) (2015)
Marcello M. Bonsangue, Jurriaan Rot, Davide Ancona, Frank S. de Boer, Jan J. M. M. Rutten
A Coalgebraic Foundation for Coinductive Union Types. ICALP (2) (2014)
Filippo Bonchi, Marcello M. Bonsangue, Helle Hvid Hansen, Prakash Panangaden, Jan J. M. M. Rutten, Alexandra Silva
Algebra-coalgebra duality in Brzozowski's minimization algorithm. ACM Trans. Comput. Log. 15 (1) (2014)
Jurriaan Rot, Marcello M. Bonsangue, Jan J. M. M. Rutten
Coinductive Proof Techniques for Language Equivalence. LATA (2013)
Marcello M. Bonsangue, Georgiana Caltais, Eugen-Ioan Goriac, Dorel Lucanu, Jan J. M. M. Rutten, Alexandra Silva
Automatic equivalence proofs for non-deterministic coalgebras. Sci. Comput. Program. 78 (9) (2013)
Jurriaan Rot, Marcello M. Bonsangue, Jan J. M. M. Rutten
Coalgebraic Bisimulation-Up-To. SOFSEM (2013)
Milad Niqui, Jan J. M. M. Rutten
Stream processing coalgebraically. Sci. Comput. Program. 78 (11) (2013)
Joost Winter, Marcello M. Bonsangue, Jan J. M. M. Rutten
Coalgebraic Characterizations of Context-Free Languages. Log. Methods Comput. Sci. 9 (3) (2013)
Marcello M. Bonsangue, Georgiana Caltais, Eugen-Ioan Goriac, Dorel Lucanu, Jan J. M. M. Rutten, Alexandra Silva
Automatic Equivalence Proofs for Non-deterministic Coalgebras CoRR (2013)
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten
Generalizing determinization from automata to coalgebras Log. Methods Comput. Sci. 9 (1) (2013)
Filippo Bonchi, Marcello M. Bonsangue, Michele Boreale, Jan J. M. M. Rutten, Alexandra Silva
A coalgebraic perspective on linear weighted automata. Inf. Comput. 211 (2012)
Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva
Brzozowski's Algorithm (Co)Algebraically. Logic and Program Semantics (2012)
Filippo Bonchi, Marcello M. Bonsangue, Georgiana Caltais, Jan J. M. M. Rutten, Alexandra Silva
Final Semantics for Decorated Traces. MFPS (2012)
Marcello M. Bonsangue, Jan J. M. M. Rutten, Joost Winter
Defining Context-Free Power Series Coalgebraically. CMCS (2012)
Sun Meng, Farhad Arbab, Bernhard K. Aichernig, Lacramioara Astefanoaei, Frank S. de Boer, Jan J. M. M. Rutten
Connectors as designs: Modeling, refinement and test case generation. Sci. Comput. Program. 77 (7-8) (2012)
Clemens Kupke, Jan J. M. M. Rutten
On the Final Coalgebra of Automatic Sequences. Logic and Program Semantics (2012)
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten
Quantitative Kleene coalgebras. Inf. Comput. 209 (5) (2011)
Bart Jacobs, Milad Niqui, Jan J. M. M. Rutten, Alexandra Silva
Preface. Theor. Comput. Sci. 412 (38) (2011)
Milad Niqui, Jan J. M. M. Rutten
A proof of Moessner's theorem by coinduction. High. Order Symb. Comput. 24 (3) (2011)
Joost Winter, Marcello M. Bonsangue, Jan J. M. M. Rutten
Context-Free Languages, Coalgebraically. CALCO (2011)
David Costa, Milad Niqui, Jan J. M. M. Rutten
Intentional Automata: A Context-Dependent Model for Component Connectors - (Extended Abstract). FSEN (2011)
Helle Hvid Hansen, Jan J. M. M. Rutten
Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions. Sci. Ann. Comput. Sci. 20 (2010)
Bart Jacobs, Milad Niqui, Jan J. M. M. Rutten, Alexandra Silva
Preface. CMCS (2010)
Milad Niqui, Jan J. M. M. Rutten
Sampling, Splitting and Merging in Coinductive Stream Calculus. MPC (2010)
Clemens Kupke, Jan J. M. M. Rutten
Complete sets of cooperations. Inf. Comput. 208 (12) (2010)
Alexandra Silva, Marcello M. Bonsangue, Jan J. M. M. Rutten
Non-Deterministic Kleene Coalgebras Log. Methods Comput. Sci. 6 (3) (2010)
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten
Generalizing the powerset construction, coalgebraically. FSTTCS (2010)
Marcello M. Bonsangue, Georgiana Caltais, Eugen-Ioan Goriac, Dorel Lucanu, Jan J. M. M. Rutten, Alexandra Silva
A Decision Procedure for Bisimilarity of Generalized Regular Expressions. SBMF (2010)
Alexandra Silva, Jan J. M. M. Rutten
A coinductive calculus of binary trees. Inf. Comput. 208 (5) (2010)
Bernhard K. Aichernig, Farhad Arbab, Lacramioara Astefanoaei, Frank S. de Boer, Sun Meng, Jan J. M. M. Rutten
Fault-Based Test Case Generation for Component Connectors. TASE (2009)
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva
An Algebra for Kripke Polynomial Coalgebras. LICS (2009)
Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva
Deriving Syntax and Axioms for Quantitative Regular Behaviours. CONCUR (2009)
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva
A Kleene Theorem for Polynomial Coalgebras. FoSSaCS (2009)
Jan J. M. M. Rutten
Rational streams coalgebraically CoRR (2008)
Jan J. M. M. Rutten
Rational Streams Coalgebraically. Log. Methods Comput. Sci. 4 (3) (2008)
Jan J. M. M. Rutten
A Roman Senator. Concurrency, Graphs and Models (2008)
Clemens Kupke, Jan J. M. M. Rutten
Observational Coalgebras and Complete Sets of Co-operations. CMCS (2008)
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva
Coalgebraic Logic and Synthesis of Mealy Machines. FoSSaCS (2008)
Jan J. M. M. Rutten
Coalgebraic Foundations of Linear Systems. CALCO (2007)
Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten
Models and temporal logical specifications for timed component connectors. Softw. Syst. Model. 6 (1) (2007)
Alexandra Silva, Jan J. M. M. Rutten
Behavioural Differential Equations and Coinduction for Binary Trees. WoLLIC (2007)
Christel Baier, Marjan Sirjani, Farhad Arbab, Jan J. M. M. Rutten
Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61 (2) (2006)
Jan J. M. M. Rutten
Algebraic Specification and Coalgebraic Synthesis of Mealy Automata. Electron. Notes Theor. Comput. Sci. 160 (2006)
José Luiz Fiadeiro, Jan J. M. M. Rutten
Preface. Theor. Comput. Sci. 366 (1-2) (2006)
Helle Hvid Hansen, David Costa, Jan J. M. M. Rutten
Synthesis of Mealy Machines Using Derivatives. CMCS (2006)
Jan J. M. M. Rutten
A coinductive calculus of streams. Math. Struct. Comput. Sci. 15 (1) (2005)
Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten, Marjan Sirjani
Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications. COORDINATION (2005)
Jan J. M. M. Rutten
A tutorial on coinductive stream calculus and signal flow graphs. Theor. Comput. Sci. 343 (3) (2005)
Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten
Models and Temporal Logics for Timed Component Connectors. SEFM (2004)
Farhad Arbab, Christel Baier, Jan J. M. M. Rutten, Marjan Sirjani
Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract). Electron. Notes Theor. Comput. Sci. 97 (2004)
Jan J. M. M. Rutten
An Application of Stream Calculus to Signal Flow Graphs. FMCO (2003)
Jan J. M. M. Rutten
Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theor. Comput. Sci. 308 (1-3) (2003)
Jan J. M. M. Rutten
Coinductive Counting with Weighted Automata. J. Autom. Lang. Comb. 8 (2) (2003)
Farhad Arbab, Jan J. M. M. Rutten
A Coinductive Calculus of Component Connectors. WADT (2002)
Bart Jacobs, Jan J. M. M. Rutten
Coalgebraic Methods in Computer Science - Foreword. Theor. Comput. Sci. 280 (1-2) (2002)
Jan J. M. M. Rutten
Coinductive Counting: Bisimulation in Enumerative Combinatorics. CMCS (2002)
Jan J. M. M. Rutten
Elements of Stream Calculus (An Extensive Exercise in Coinduction). MFPS (2001)
Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten
Foreword : Coalgebraic Methods in Computer Science 1998. Theor. Comput. Sci. 260 (1-2) (2001)
Jan J. M. M. Rutten
Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249 (1) (2000)
Jan J. M. M. Rutten
Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series. MPC (2000)
Marcello M. Bonsangue, Farhad Arbab, J. W. de Bakker, Jan J. M. M. Rutten, A. Secutella, Gianluigi Zavattaro
A transition system semantics for the control-driven coordination language MANIFOLD. Theor. Comput. Sci. 240 (1) (2000)
Jan J. M. M. Rutten
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously. ICALP (1999)
Bart Jacobs, Jan J. M. M. Rutten
Preface. CMCS (1999)
Erik P. de Vink, Jan J. M. M. Rutten
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. Theor. Comput. Sci. 221 (1-2) (1999)
Jan J. M. M. Rutten
A note on coinduction and weak bisimilarity for while programs. RAIRO Theor. Informatics Appl. 33 (4/5) (1999)
Marcello M. Bonsangue, Franck van Breugel, Jan J. M. M. Rutten
Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding. Theor. Comput. Sci. 193 (1-2) (1998)
Daniele Turi, Jan J. M. M. Rutten
On the Foundations of Final Coalgebra Semantics. Math. Struct. Comput. Sci. 8 (5) (1998)
Jan J. M. M. Rutten
Relators and Metric Bisimulations. CMCS (1998)
Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten
Preface. CMCS (1998)
Jan J. M. M. Rutten
Automata and Coinduction (An Exercise in Coalgebra). CONCUR (1998)
Erik P. de Vink, Jan J. M. M. Rutten
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. ICALP (1997)
Jan J. M. M. Rutten
Elements of Generalized Ultrametric Domain Theory. Theor. Comput. Sci. 170 (1-2) (1996)
Fabio Alessi, Paolo Baldan, Gianna Bellè, Jan J. M. M. Rutten
Solutions of functorial and non-functorial metric domain equations. MFPS (1995)
Eiichi Horita, J. W. de Bakker, Jan J. M. M. Rutten
Fully Abstract Denotational Models for Nonuniform Concurrent Languages Inf. Comput. 115 (1) (1994)
Jan J. M. M. Rutten
A Strucutral Co-Induction Theorem. MFPS (1993)
Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
Non-monotonic Concurrent Constraint Programming. ILPS (1993)
Jan J. M. M. Rutten, Daniele Turi
Initial Algebra and Final Coalgebra Semantics for Concurrency. REX School/Symposium (1993)
Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
On Blocks: Locality and Asynchronous Communication (Extended Abstract). REX Workshop (1992)
Pierre America, Jan J. M. M. Rutten
A Layered Semantics for a Parallel Object-Oriented Language. Formal Aspects Comput. 4 (4) (1992)
Jan J. M. M. Rutten
Processes as Terms: Non-Well-Founded Models for Bisimulation. Math. Struct. Comput. Sci. 2 (3) (1992)
Jan J. M. M. Rutten, Daniele Turi
On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders. REX Workshop (1992)
Jan J. M. M. Rutten, Jeffery I. Zucker
A semantic approach to fairness. Fundam. Informaticae 16 (1) (1992)
Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic. Theor. Comput. Sci. 101 (2) (1992)
Jan J. M. M. Rutten
Nonwellfounded Sets and Programming Language Semantics. MFPS (1991)
Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
The Failure of Failures in a Paradigm for Asynchronous Communication. CONCUR (1991)
Frank S. de Boer, Jan J. M. M. Rutten, Joost N. Kok, Catuscia Palamidessi
Semantic Models for Concurrent Logic Languages. Theor. Comput. Sci. 86 (1) (1991)
Joost N. Kok, Jan J. M. M. Rutten
Contractions in Comparing Concurrency Semantics. Theor. Comput. Sci. 76 (2-3) (1990)
Jan J. M. M. Rutten
Deriving Denotational Models for Bisimulation from Structured Operational Semantics. Programming Concepts and Methods (1990)
Jan J. M. M. Rutten
Semantic Correctness for a Parallel Object-Oriented Language. SIAM J. Comput. 19 (2) (1990)
Pierre America, Jan J. M. M. Rutten
A Layered Semantics for a Parallel Object-Oriented Language. REX Workshop (1990)
Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
Semantic Models for a Version of PARLOG. ICLP (1989)
Pierre America, Jaco de Bakker, Joost N. Kok, Jan J. M. M. Rutten
Denotational Semantics of a Parallel Object-Oriented Language Inf. Comput. 83 (2) (1989)
Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
Control Flow versus Logic: A Denotational and a Declarative Model for Guarded Horn Clauses. MFCS (1989)
Pierre America, Jan J. M. M. Rutten
Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. J. Comput. Syst. Sci. 39 (3) (1989)
Joost N. Kok, Jan J. M. M. Rutten
Contractions in Comparing Concurrent Semantics. ICALP (1988)

Jan J. M. M. Rutten.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jan J. M. M. Rutten