Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jan J. M. M. Rutten
2010 – today
- 2013
[j49]Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten: Generalizing determinization from automata to coalgebras. Logical Methods in Computer Science 9(1) (2013)- [c40]Jurriaan Rot, Marcello M. Bonsangue, Jan J. M. M. Rutten: Coinductive Proof Techniques for Language Equivalence. LATA 2013: 480-492
- [c39]Jurriaan Rot, Marcello M. Bonsangue, Jan J. M. M. Rutten: Coalgebraic Bisimulation-Up-To. SOFSEM 2013: 369-381
- [i2]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 abs/1303.1994 (2013)
- 2012
- [j48]Filippo Bonchi, Marcello M. Bonsangue, Georgiana Caltais, Jan J. M. M. Rutten, Alexandra Silva: Final Semantics for Decorated Traces. Electr. Notes Theor. Comput. Sci. 286: 73-86 (2012)
- [j47]Filippo Bonchi, Marcello M. Bonsangue, Michele Boreale, Jan J. M. M. Rutten, Alexandra Silva: A coalgebraic perspective on linear weighted automata. Inf. Comput. 211: 77-105 (2012)
- [j46]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): 799-822 (2012)
- [c38]Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva: Brzozowski's Algorithm (Co)Algebraically. Logic and Program Semantics 2012: 12-23
- [c37]Clemens Kupke, Jan J. M. M. Rutten: On the Final Coalgebra of Automatic Sequences. Logic and Program Semantics 2012: 149-164
- [c36]Marcello M. Bonsangue, Jan J. M. M. Rutten, Joost Winter: Defining Context-Free Power Series Coalgebraically. CMCS 2012: 20-39
- 2011
- [j45]Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten: Quantitative Kleene coalgebras. Inf. Comput. 209(5): 822-849 (2011)
- [j44]Milad Niqui, Jan J. M. M. Rutten: A proof of Moessner's theorem by coinduction. Higher-Order and Symbolic Computation 24(3): 191-206 (2011)
- [j43]Bart Jacobs, Milad Niqui, Jan J. M. M. Rutten, Alexandra Silva: Preface. Theor. Comput. Sci. 412(38): 4967-4968 (2011)
- [c35]Joost Winter, Marcello M. Bonsangue, Jan J. M. M. Rutten: Context-Free Languages, Coalgebraically. CALCO 2011: 359-376
- [c34]David Costa, Milad Niqui, Jan J. M. M. Rutten: Intentional Automata: A Context-Dependent Model for Component Connectors - (Extended Abstract). FSEN 2011: 335-342
- 2010
- [j42]Alexandra Silva, Marcello M. Bonsangue, Jan J. M. M. Rutten: Non-Deterministic Kleene Coalgebras. Logical Methods in Computer Science 6(3) (2010)
- [j41]Helle Hvid Hansen, Jan J. M. M. Rutten: Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions. Sci. Ann. Comp. Sci. 20: 97-130 (2010)
- [j40]Bart Jacobs, Milad Niqui, Jan J. M. M. Rutten, Alexandra Silva: Preface. Electr. Notes Theor. Comput. Sci. 264(2): 1-2 (2010)
- [j39]Alexandra Silva, Jan J. M. M. Rutten: A coinductive calculus of binary trees. Inf. Comput. 208(5): 578-593 (2010)
- [j38]Clemens Kupke, Jan J. M. M. Rutten: Complete sets of cooperations. Inf. Comput. 208(12): 1398-1420 (2010)
- [c33]Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten: Generalizing the powerset construction, coalgebraically. FSTTCS 2010: 272-283
- [c32]Milad Niqui, Jan J. M. M. Rutten: Sampling, Splitting and Merging in Coinductive Stream Calculus. MPC 2010: 310-330
- [c31]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: 226-241
2000 – 2009
- 2009
- [c30]Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva: Deriving Syntax and Axioms for Quantitative Regular Behaviours. CONCUR 2009: 146-162
- [c29]Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva: A Kleene Theorem for Polynomial Coalgebras. FOSSACS 2009: 122-136
- [c28]Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva: An Algebra for Kripke Polynomial Coalgebras. LICS 2009: 49-58
- [c27]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: 147-154
- 2008
- [j37]Clemens Kupke, Jan J. M. M. Rutten: Observational Coalgebras and Complete Sets of Co-operations. Electr. Notes Theor. Comput. Sci. 203(5): 153-174 (2008)
- [j36]Jan J. M. M. Rutten: Rational Streams Coalgebraically. Logical Methods in Computer Science 4(3) (2008)
- [c26]
- [c25]Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva: Coalgebraic Logic and Synthesis of Mealy Machines. FoSSaCS 2008: 231-245
- [i1]
- 2007
- [j35]Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten: Models and temporal logical specifications for timed component connectors. Software and System Modeling 6(1): 59-82 (2007)
- [c24]
- [c23]Alexandra Silva, Jan J. M. M. Rutten: Behavioural Differential Equations and Coinduction for Binary Trees. WoLLIC 2007: 322-336
- 2006
- [j34]Jan J. M. M. Rutten: Algebraic Specification and Coalgebraic Synthesis of Mealy Automata. Electr. Notes Theor. Comput. Sci. 160: 305-319 (2006)
- [j33]Helle Hvid Hansen, David Costa, Jan J. M. M. Rutten: Synthesis of Mealy Machines Using Derivatives. Electr. Notes Theor. Comput. Sci. 164(1): 27-45 (2006)
- [j32]Christel Baier, Marjan Sirjani, Farhad Arbab, Jan J. M. M. Rutten: Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61(2): 75-113 (2006)
- [j31]
- 2005
- [j30]Jan J. M. M. Rutten: A coinductive calculus of streams. Mathematical Structures in Computer Science 15(1): 93-147 (2005)
- [j29]Jan J. M. M. Rutten: A tutorial on coinductive stream calculus and signal flow graphs. Theor. Comput. Sci. 343(3): 443-481 (2005)
- [c22]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: 236-251
- [e1]José Luiz Fiadeiro, Neil Harman, Markus Roggenbach, Jan J. M. M. Rutten (Eds.): Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings. Lecture Notes in Computer Science 3629, Springer 2005, ISBN 3-540-28620-9
- 2004
- [j28]Farhad Arbab, Christel Baier, Jan J. M. M. Rutten, Marjan Sirjani: Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 97: 25-46 (2004)
- [c21]Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten: Models and Temporal Logics for Timed Component Connectors. SEFM 2004: 198-207
- 2003
- [j27]Jan J. M. M. Rutten: Coinductive Counting with Weighted Automata. Journal of Automata, Languages and Combinatorics 8(2): 319-352 (2003)
- [j26]Jan J. M. M. Rutten: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theor. Comput. Sci. 308(1-3): 1-53 (2003)
- [c20]
- 2002
- [j25]Jan J. M. M. Rutten: Coinductive Counting: Bisimulation in Enumerative Combinatorics. Electr. Notes Theor. Comput. Sci. 65(1): 286-304 (2002)
- [j24]Bart Jacobs, Jan J. M. M. Rutten: Coalgebraic Methods in Computer Science - Foreword. Theor. Comput. Sci. 280(1-2): 1 (2002)
- [c19]
- 2001
- [j23]Jan J. M. M. Rutten: Elements of Stream Calculus (An Extensive Exercise in Coinduction). Electr. Notes Theor. Comput. Sci. 45: 358-423 (2001)
- [j22]Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten: Foreword : Coalgebraic Methods in Computer Science 1998. Theor. Comput. Sci. 260(1-2): 1 (2001)
- 2000
- [j21]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): 3-47 (2000)
- [j20]Jan J. M. M. Rutten: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1): 3-80 (2000)
- [c18]Jan J. M. M. Rutten: Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series. MPC 2000: 100-101
1990 – 1999
- 1999
- [j19]
- [j18]Jan J. M. M. Rutten: A note on coinduction and weak bisimilarity for while programs. ITA 33(4/5): 393-400 (1999)
- [j17]Erik P. de Vink, Jan J. M. M. Rutten: Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. Theor. Comput. Sci. 221(1-2): 271-293 (1999)
- [c17]Jan J. M. M. Rutten: Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously. ICALP 1999: 645-654
- 1998
- [j16]Jan J. M. M. Rutten: Relators and Metric Bisimulations. Electr. Notes Theor. Comput. Sci. 11: 252-258 (1998)
- [j15]Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten: Preface. Electr. Notes Theor. Comput. Sci. 11: 259 (1998)
- [j14]Daniele Turi, Jan J. M. M. Rutten: On the Foundations of Final Coalgebra Semantics. Mathematical Structures in Computer Science 8(5): 481-540 (1998)
- [j13]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): 1-51 (1998)
- [c16]
- 1997
- [c15]Erik P. de Vink, Jan J. M. M. Rutten: Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. ICALP 1997: 460-470
- 1996
- [j12]Jan J. M. M. Rutten: Elements of Generalized Ultrametric Domain Theory. Theor. Comput. Sci. 170(1-2): 349-381 (1996)
- 1995
- [j11]Fabio Alessi, Paolo Baldan, Gianna Bellè, Jan J. M. M. Rutten: Solutions of functorial and non-functorial metric domain equations. Electr. Notes Theor. Comput. Sci. 1: 1-12 (1995)
- 1994
- [j10]Eiichi Horita, J. W. de Bakker, Jan J. M. M. Rutten: Fully Abstract Denotational Models for Nonuniform Concurrent Languages. Inf. Comput. 115(1): 125-178 (1994)
- 1993
- [c14]
- [c13]Jan J. M. M. Rutten, Daniele Turi: Initial Algebra and Final Coalgebra Semantics for Concurrency. REX School/Symposium 1993: 530-582
- [c12]Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten: Non-monotonic Concurrent Constraint Programming. ILPS 1993: 315-334
- 1992
- [j9]Pierre America, Jan J. M. M. Rutten: A Layered Semantics for a Parallel Object-Oriented Language. Formal Asp. Comput. 4(4): 376-408 (1992)
- [j8]Jan J. M. M. Rutten, Jeffery I. Zucker: A semantic approach to fairness. Fundam. Inform. 16(1): 1-38 (1992)
- [j7]Jan J. M. M. Rutten: Processes as Terms: Non-Well-Founded Models for Bisimulation. Mathematical Structures in Computer Science 2(3): 257-275 (1992)
- [j6]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): 239-263 (1992)
- [c11]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: 73-90
- [c10]Jan J. M. M. Rutten, Daniele Turi: On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders. REX Workshop 1992: 477-530
- 1991
- [j5]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): 3-33 (1991)
- [c9]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: 111-126
- [c8]
- 1990
- [j4]Jan J. M. M. Rutten: Semantic Correctness for a Parallel Object-Oriented Language. SIAM J. Comput. 19(2): 341-383 (1990)
- [j3]Joost N. Kok, Jan J. M. M. Rutten: Contractions in Comparing Concurrency Semantics. Theor. Comput. Sci. 76(2-3): 179-222 (1990)
- [c7]Pierre America, Jan J. M. M. Rutten: A Layered Semantics for a Parallel Object-Oriented Language. REX Workshop 1990: 91-123
1980 – 1989
- 1989
- [j2]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): 152-205 (1989)
- [j1]Pierre America, Jan J. M. M. Rutten: Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. J. Comput. Syst. Sci. 39(3): 343-375 (1989)
- [c6]Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten: Semantic Models for a Version of PARLOG. ICLP 1989: 621-636
- [c5]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: 165-176
- 1988
- [c4]Joost N. Kok, Jan J. M. M. Rutten: Contractions in Comparing Concurrent Semantics. ICALP 1988: 317-332
- [c3]Jan J. M. M. Rutten: Correctness and full abstraction of metric semantics for concurrency. REX Workshop 1988: 628-659
- 1987
- [c2]Pierre America, Jan J. M. M. Rutten: Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. MFPS 1987: 254-288
- 1986
- [c1]Pierre America, Jaco de Bakker, Joost N. Kok, Jan J. M. M. Rutten: Operational Semantics of a Parallel Object-Oriented Language. POPL 1986: 194-208
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-02 03:07 CEST by the dblp team