The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan J. M. M. Rutten: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    The Failure of Failures in a Paradigm for Asynchronous Communication. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:111-126 [Conf]
  2. Jan J. M. M. Rutten
    Automata and Coinduction (An Exercise in Coalgebra). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1998, pp:194-218 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    COORDINATION, 2005, pp:236-251 [Conf]
  4. Jan J. M. M. Rutten
    An Application of Stream Calculus to Signal Flow Graphs. [Citation Graph (0, 0)][DBLP]
    FMCO, 2003, pp:276-291 [Conf]
  5. Joost N. Kok, Jan J. M. M. Rutten
    Contractions in Comparing Concurrent Semantics. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:317-332 [Conf]
  6. Jan J. M. M. Rutten
    Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:645-654 [Conf]
  7. Erik P. de Vink, Jan J. M. M. Rutten
    Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:460-470 [Conf]
  8. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    Semantic Models for a Version of PARLOG. [Citation Graph (0, 0)][DBLP]
    ICLP, 1989, pp:621-636 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:165-176 [Conf]
  10. Pierre America, Jan J. M. M. Rutten
    Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. [Citation Graph (0, 0)][DBLP]
    MFPS, 1987, pp:254-288 [Conf]
  11. Jan J. M. M. Rutten
    Nonwellfounded Sets and Programming Language Semantics. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:193-206 [Conf]
  12. Jan J. M. M. Rutten
    A Strucutral Co-Induction Theorem. [Citation Graph (0, 0)][DBLP]
    MFPS, 1993, pp:83-102 [Conf]
  13. Jan J. M. M. Rutten
    Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series. [Citation Graph (0, 0)][DBLP]
    MPC, 2000, pp:100-101 [Conf]
  14. Pierre America, Jaco de Bakker, Joost N. Kok, Jan J. M. M. Rutten
    Operational Semantics of a Parallel Object-Oriented Language. [Citation Graph (0, 0)][DBLP]
    POPL, 1986, pp:194-208 [Conf]
  15. Pierre America, Jan J. M. M. Rutten
    A Layered Semantics for a Parallel Object-Oriented Language. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1990, pp:91-123 [Conf]
  16. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    On Blocks: Locality and Asynchronous Communication (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1992, pp:73-90 [Conf]
  17. Jan J. M. M. Rutten
    Correctness and full abstraction of metric semantics for concurrency. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1988, pp:628-659 [Conf]
  18. Jan J. M. M. Rutten, Daniele Turi
    On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1992, pp:477-530 [Conf]
  19. Jan J. M. M. Rutten, Daniele Turi
    Initial Algebra and Final Coalgebra Semantics for Concurrency. [Citation Graph (0, 0)][DBLP]
    REX School/Symposium, 1993, pp:530-582 [Conf]
  20. Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten
    Models and Temporal Logics for Timed Component Connectors. [Citation Graph (0, 0)][DBLP]
    SEFM, 2004, pp:198-207 [Conf]
  21. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    Non-monotonic Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:315-334 [Conf]
  22. Farhad Arbab, Jan J. M. M. Rutten
    A Coinductive Calculus of Component Connectors. [Citation Graph (0, 0)][DBLP]
    WADT, 2002, pp:34-55 [Conf]
  23. Farhad Arbab, Christel Baier, Jan J. M. M. Rutten, Marjan Sirjani
    Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:97, n:, pp:25-46 [Journal]
  24. Fabio Alessi, Paolo Baldan, Gianna Bellè, Jan J. M. M. Rutten
    Solutions of functorial and non-functorial metric domain equations. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:1, n:, pp:- [Journal]
  25. Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:11, n:, pp:- [Journal]
  26. Bart Jacobs, Jan J. M. M. Rutten
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:19, n:, pp:- [Journal]
  27. Jan J. M. M. Rutten
    Elements of Stream Calculus (An Extensive Exercise in Coinduction). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:45, n:, pp:- [Journal]
  28. Jan J. M. M. Rutten
    Coinductive Counting: Bisimulation in Enumerative Combinatorics. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:65, n:1, pp:- [Journal]
  29. Jan J. M. M. Rutten
    Relators and Metric Bisimulations. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:11, n:, pp:- [Journal]
  30. Jan J. M. M. Rutten
    Algebraic Specification and Coalgebraic Synthesis of Mealy Automata. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:160, n:, pp:305-319 [Journal]
  31. Helle Hvid Hansen, David Costa, Jan J. M. M. Rutten
    Synthesis of Mealy Machines Using Derivatives. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:164, n:1, pp:27-45 [Journal]
  32. Pierre America, Jan J. M. M. Rutten
    A Layered Semantics for a Parallel Object-Oriented Language. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1992, v:4, n:4, pp:376-408 [Journal]
  33. Jan J. M. M. Rutten, Jeffery I. Zucker
    A semantic approach to fairness. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1992, v:16, n:1, pp:1-38 [Journal]
  34. Pierre America, Jaco de Bakker, Joost N. Kok, Jan J. M. M. Rutten
    Denotational Semantics of a Parallel Object-Oriented Language [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:2, pp:152-205 [Journal]
  35. Eiichi Horita, J. W. de Bakker, Jan J. M. M. Rutten
    Fully Abstract Denotational Models for Nonuniform Concurrent Languages [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:115, n:1, pp:125-178 [Journal]
  36. Jan J. M. M. Rutten
    A note on coinduction and weak bisimilarity for while programs. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:4/5, pp:393-400 [Journal]
  37. Jan J. M. M. Rutten
    Coinductive Counting with Weighted Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:2, pp:319-352 [Journal]
  38. Pierre America, Jan J. M. M. Rutten
    Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:3, pp:343-375 [Journal]
  39. Jan J. M. M. Rutten
    A coinductive calculus of streams. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2005, v:15, n:1, pp:93-147 [Journal]
  40. Jan J. M. M. Rutten
    Processes as Terms: Non-Well-Founded Models for Bisimulation. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1992, v:2, n:3, pp:257-275 [Journal]
  41. Daniele Turi, Jan J. M. M. Rutten
    On the Foundations of Final Coalgebra Semantics. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1998, v:8, n:5, pp:481-540 [Journal]
  42. Christel Baier, Marjan Sirjani, Farhad Arbab, Jan J. M. M. Rutten
    Modeling component connectors in Reo by constraint automata. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2006, v:61, n:2, pp:75-113 [Journal]
  43. Jan J. M. M. Rutten
    Semantic Correctness for a Parallel Object-Oriented Language. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:341-383 [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:101, n:2, pp:239-263 [Journal]
  45. Frank S. de Boer, Jan J. M. M. Rutten, Joost N. Kok, Catuscia Palamidessi
    Semantic Models for Concurrent Logic Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:1, pp:3-33 [Journal]
  46. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:1, pp:3-47 [Journal]
  47. Marcello M. Bonsangue, Franck van Breugel, Jan J. M. M. Rutten
    Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:1-51 [Journal]
  48. José Luiz Fiadeiro, Jan J. M. M. Rutten
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:366, n:1-2, pp:1-2 [Journal]
  49. Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten
    Foreword : Coalgebraic Methods in Computer Science 1998. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:260, n:1-2, pp:1- [Journal]
  50. Bart Jacobs, Jan J. M. M. Rutten
    Coalgebraic Methods in Computer Science - Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:280, n:1-2, pp:1- [Journal]
  51. Joost N. Kok, Jan J. M. M. Rutten
    Contractions in Comparing Concurrency Semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:76, n:2-3, pp:179-222 [Journal]
  52. Jan J. M. M. Rutten
    Universal coalgebra: a theory of systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:249, n:1, pp:3-80 [Journal]
  53. Jan J. M. M. Rutten
    Behavioural differential equations: a coinductive calculus of streams, automata, and power series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:308, n:1-3, pp:1-53 [Journal]
  54. Jan J. M. M. Rutten
    A tutorial on coinductive stream calculus and signal flow graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:3, pp:443-481 [Journal]
  55. Jan J. M. M. Rutten
    Elements of Generalized Ultrametric Domain Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:170, n:1-2, pp:349-381 [Journal]
  56. Erik P. de Vink, Jan J. M. M. Rutten
    Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:271-293 [Journal]
  57. Jan J. M. M. Rutten
    Coalgebraic Foundations of Linear Systems. [Citation Graph (0, 0)][DBLP]
    CALCO, 2007, pp:425-446 [Conf]
  58. Alexandra Silva, Jan J. M. M. Rutten
    Behavioural Differential Equations and Coinduction for Binary Trees. [Citation Graph (0, 0)][DBLP]
    WoLLIC, 2007, pp:322-336 [Conf]

  59. A Roman Senator. [Citation Graph (, )][DBLP]


  60. Deriving Syntax and Axioms for Quantitative Regular Behaviours. [Citation Graph (, )][DBLP]


  61. Coalgebraic Logic and Synthesis of Mealy Machines. [Citation Graph (, )][DBLP]


  62. A Kleene Theorem for Polynomial Coalgebras. [Citation Graph (, )][DBLP]


  63. An Algebra for Kripke Polynomial Coalgebras. [Citation Graph (, )][DBLP]


  64. Sampling, Splitting and Merging in Coinductive Stream Calculus. [Citation Graph (, )][DBLP]


  65. Fault-Based Test Case Generation for Component Connectors. [Citation Graph (, )][DBLP]


  66. Rational streams coalgebraically [Citation Graph (, )][DBLP]


  67. Non-Deterministic Kleene Coalgebras [Citation Graph (, )][DBLP]


  68. Observational Coalgebras and Complete Sets of Co-operations. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002