Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Publications of Jan Rutten since 1995
[go: Go Back, main page]

Publications since 1995

2006:

J.L. Fiadeiro, J.J.M.M. Rutten, editors.
Algebra and Coalgebra in Computer Science.
Special issue of Theoretical Computer Science Vol. 366(1-2), 2006, pp. 1-180.

F. Arbab, C. Baier, M. Sirjani, J.J.M.M. Rutten.
Modeling component connectors in Reo by constraint automata,
Science of Computer Programming Vol. 61(2), 2006, pp. 75-113.

H. Hansen, D. Costa, J.J.M.M. Rutten.
Synthesis of Mealy machines using derivatives.
Proceedings CMCS 2006, ENTCS Vol. 164, Elsevier, 2006, pp. 27-45.
Full paper (pdf).
See the webpage for a corresponding tool (source code, executable, documentation) here.

J.J.M.M. Rutten.
Algebraic specification and coalgebraic synthesis of Mealy automata.
Proceedings FACS 2005, ENTCS Vol. 160, Elsevier, 2006, pp. 305-319.
Full paper (pdf).

2005:

J.J.M.M. Rutten
A tutorial on coinductive stream calculus and signal flow graphs.
Theoretical Computer Science Volume 343(3), pp. 443--481, 2005.
An extended abstract of this paper appeared in LNCS 3188, 2004 (see below).

J.L. Fiadeiro, N. Harman, M. Roggenbach, J.J.M.M. Rutten, editors.
Proceedings of First International Conference on Algebra and Coalgebra in Computer Science (CALCO 2005).
Lecture Notes in Computer Science 3629, Springer, 2005, 457 pages.

F. Arbab, C. Baier, F.S. de Boer, J.J.M.M. Rutten, M. Sirjani.
Synthesis of Reo Circuits For Implementation Of Component-Connector Automata Specifications.
In: Proceedings of Coordination 2005, LNCS 3454, 2005, pp. 236-251.

J.J.M.M. Rutten.
Algebraic specification and coalgebraic synthesis of Mealy automata.
Proceedings FACS 2005, ENTCS, see under 2006. A preprint appeared as:
Technical Report SEN-R0514, CWI, Amsterdam, 2005, pp. 1--16.
[Abstract] [Full paper (PDF-file)]

J.J.M.M. Rutten.
A coinductive calculus of streams.
Mathematical Structures in Computer Science, Vol. 15, pp. 93-147, 2005.
A preprint appeared earlier as Technical Report SEN-R0120, CWI, Amsterdam.

J.J.M.M. Rutten
Algebra, bitstreams, and circuits
In: Contributions to General Algebra Vol. 16, Verlag Johannes Heyn, Klagenfurt, 2005, pp. 231--250.
A preprint appeared earlier as: Technical Report SEN-R0502, CWI, Amsterdam, 2005, pp. 1--21.
[Abstract] [Full paper (PDF-file)]

2004:

F. Arbab, C. Baier, F.S. de Boer, J.J.M.M. Rutten, M. Sirjani.
Synthesis of Reo Circuits For Implementation Of Component-Connector Automata Specifications.
Technical Report SEN-R0412, CWI, Amsterdam, 2004, pp. 1--18.
[Abstract] [Full paper (PDF-file)]
Also in: Proceedings of Coordination 2005, see above.

F. Arbab, C. Baier, F.S. de Boer, J.J.M.M. Rutten.
Models and Temporal Logics for Timed Component Connectors.
Technical Report SEN-R0411, CWI, Amsterdam, 2004, pp. 1--24.
[Abstract] [Full paper (PDF-file)]
Also in: In: Proceedings of the IEEE International Conference on Software Engineering and Formal Methods (SEFM '04), 2004, pp. 198-207. An extended version of this paper will appear in: International Journal on Software and Systems Modelling (2005).

J.J.M.M. Rutten
An application of stream calculus to signal flow graphs.
In: Proceedings FMCO 2003 (Formal Methods for Components and Objects).
Editors: F.S. de Boer, M.M. Bonsangue, S. Graf, W.P de Roever.
Lecture Notes in Computer Science 3188, Springer Verlag, 2004, pp. 276-291.
[Abstract] [Full paper (in pdf)]
This paper contains the technical core of Technical Report SEN-E0305 (CWI, Amsterdam, 2003) mentioned below.

J.J.M.M. Rutten, Marta Kwiatkowska, Norman Gethin, David Parker.
Mathematical Techniques for analysing concurrent and probabilistic systems.
CRM Monograph series Volume 23, American Mathematical Society, 2004, 215 pages.
This book contains the lecture notes of two series of lectures that were given at a workshop at CRM, Montreal, in October 2002. The organisers and editors of the book are Prakash Panangaden and Franck van Breugel. The first part of the book, pp. 1-92, contains my lecture notes, entitled: On streams and coinduction.
[Full text (in pdf)]

J.J.M.M. Rutten
The differential calculus of bitstreams.
Technical Report SEN-E0403, CWI, Amsterdam, 2004, pp. 1--13.
[Abstract] [Full paper (PDF-file)]

2003:

F. Arbab, J.J.M.M. Rutten.
A coinductive calculus of component connectors.
In: (M. Wirsing, D. Pattinson and R. Hennicker, Eds.) Recent Trends in Algebraic Development Techniques, Proceedings of 16th International Workshop on Algebraic Development Techniques (WADT 2002), Lecture Notes in Computer Science 2755, Springer, 2003, pp. 35--56.
A preprint of this paper appeared as Technical Report SEN-R0216 (see below).

J.J.M.M. Rutten
Behavioural differential equations: a coinductive calculus of streams, automata, and power series.
Theoretical Computer Science Volume 308(1--3), pp. 1--53, 2003.
[Abstract] [Full paper (in pdf)]
A preprint of this paper appeared as Technical Report SEN-R0023 (see below).

J.J.M.M. Rutten
An application of coinductive stream calculus to signal flow graphs
Technical Report SEN-E0305, CWI, Amsterdam, 2003, pp. 1--58.
[Abstract] [Full paper (PDF-file)]

F. Arbab, C. Baier, J.J.M.M. Rutten, M. Sirjani
Modeling component connectors in Reo by constraint automata
Technical Report SEN-R0304, CWI, Amsterdam, 2003, pp. 1--15.
[Abstract] [Full paper (PDF-file)] [ Full paper (compressed PostScript)]
Also in: (A. Brogi, J.M. Jacquet, E. Pimentel, eds.) Proceedings of FOCLASA 2003, ENTCS 97, Elsevier Science B.V., 2003. An extended version will appear in Science of Computer Programming (2005).

J.J.M.M. Rutten
Coinductive counting with weighted automata.
In: Journal of Automata, Languages and Combinatorics Vol. 8, No. 2, pp. 319-352.
Special issue with selected papers of the workshop "Weighted Automata: Theory and Applications" (Dresden, Germany, March 4-8, 2002).

2002:

J.J.M.M. Rutten
Coinductive counting with weighted automata
Technical Report SEN-R0224, CWI, Amsterdam, 2002, pp. 1--30.
[Abstract] [Full Paper (pdf)]

F. Arbab, J.J.M.M. Rutten
A coinductive calculus of component connectors
Technical Report SEN-R0216, CWI, Amsterdam, 2002, pp. 1--17.
[Abstract] [Full Paper (pdf)]
Also in Proceedings WADT 2002 (see above under 2003).

J.J.M.M. Rutten
Coinductive counting: bisimulation in enumerative combinatorics
Proceedings of Coalgebraic Methods in Computer Science (CMCS '02), ENTCS Volume 65 , Elsevier Science B.V., 2002.

B. Jacobs, J. Rutten (Editors).
Coalgebraic methods in computer science.
Theoretical Computer Science 280(1-2), 2002.
Special issue including selected papers from the Second International Workshop on Coalgebraic Methods in Computer Science (CMCS '99).

2001:

J.J.M.M. Rutten
Coinductive counting: bisimulation in enumerative combinatorics (extended abstract)
Technical Report SEN-R0129, CWI, Amsterdam, 2001, pp. 1--16.
[Full Paper (pdf)]

J.J.M.M. Rutten
Elements of stream calculus (an extensive exercise in coinduction).
Technical Report SEN-R0120, CWI, Amsterdam, 2001, pp. 1--54.
[Abstract] [Full Paper (in compressed PostScript)]
Also in: Proceedings MFPS '01, ENTCS Volume 45 , Elsevier Science B.V., 2001. Also in Mathematical Structures in Computer Science Vol. 15, 2005 (see above).

B. Jacobs, L. Moss, H. Reichel, J. Rutten (Editors).
Coalgebraic methods in computer science.
Theoretical Computer Science 260(1-2), 2001.
Special issue including selected papers from the First International Workshop on Coalgebraic Methods in Computer Science (CMCS '98).

2000:

J.J.M.M. Rutten
Universal coalgebra: a theory of systems.
Theoretical Computer Science 249(1), 2000, pp. 3-80.
This is a revised and extended version of Technical Report CS-R9652 mentioned below.

J.J.M.M. Rutten
Behavioural differential equations: a coinductive calculus of streams, automata, and power series.
Technical Report SEN-R0023, CWI, Amsterdam, 2000.
[Abstract] [Full Paper (in compressed PostScript)]
This report combines and extends our earlier papers on automata and languages (CONCUR '98) and formal power series (ICALP '99). A revised version appeared in Theoretical Computer Science Volume 308, 2003 (see above).

J.J.M.M. Rutten
Coalgebra, concurrency, and control.
In: R. Boel and G. Stremersch (eds.), Discrete Event Systems (analysis and control), Proceedings of WODES 2000 (5th Workshop on Discrete Event Systems), Kluwer, 2000, pp. 31--38.
This is an extended abstract of Technical Report SEN-R9921, mentioned below.

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutella
A transition system semantics for the control-driven language MANIFOLD. Theoretical Computer Science 240, 2000, pp. 3--47.
This is an extended and improved version of Technical Report SEN-R9829, mentioned below.

1999:

J.J.M.M. Rutten
A note on coinduction and weak bisimilarity for while programs. In Theoretical Informatics and Applications (RAIRO) Vol. 33, 1999, pp. 393-400.

J.J.M.M. Rutten
Coalgebra, concurrency, and control. Technical Report SEN-R9921, CWI, Amsterdam, 1999.
[Abstract] [Full Paper (in compressed PostScript)] [Full Paper (in PDF format)]
This paper describes some first steps in the use of coinductive reasoning for problems of supervisory control of discrete event systems.

E.P. de Vink, J.J.M.M. Rutten
Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science Vol. 221(1-2), 1999, pp. 271--293. (Extended abstract in the proceedings of ICALP '97.)

B. Jacobs and J.J.M.M. Rutten (editors)
Proceedings of Second Workshop on Coalgebraic Methods in Computer Science (CMCS '99), ENTCS Volume 19 , Elsevier Science B.V., 1999.

J.J.M.M. Rutten
Automata, power series, and coinduction: taking input derivatives seriously (extended abstract). Technical Report SEN-R9901, CWI, Amsterdam, 1999.
[Abstract] [Full Paper (in pdf)]
Also in: proceedings of ICALP '99 (J. Wiedermann, P. van Emde Boas and M. Nielsen, eds.), LNCS 1644, Springer, 1999, pp. 645-654.
This paper extends the results of Technical Report SEN-R9803 (`Automata and coinduction') to the more general case of formal power series, and presents in that setting coinductive definitions in terms of so-called behavioural differential equations (which include many classical differential equations as a special case).

1998:

M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutella
A transition system semantics for the control-driven language MANIFOLD. Technical Report SEN-R9829, CWI, Amsterdam, 1998.
[Full Paper (in compressed PostScript)]
To appear in TCS.

J.J.M.M. Rutten
A note on coinduction and weak bisimilarity for while programs. Technical Report SEN-R9826, CWI, Amsterdam, 1998.
Appeared also in Theoretical Informatics and Applications (RAIRO), see under 1999 above.
[Abstract] [Full Paper (in compressed PostScript)]

E.P. de Vink, J.J.M.M. Rutten
Bisimulation for probabilistic transition systems: a coalgebraic approach. Technical Report SEN-R9825, CWI, Amsterdam, 1998.
[Abstract] [Full Paper (in compressed PostScript)]
Also in Theoretical Computer Science Vol. 221(1-2), 1999, pp. 271--293. (Extended abstract in the proceedings of ICALP '97.)

J.J.M.M. Rutten
``Jon Barwise and Larry Moss: Vicious Circles--on the mathematics of non-wellfounded phenomena'' (book review), Bulletin of the American Mathematical Society, Vol. 35(1), 1998, pp. 69--75.

M.M. Bonsangue, F. van Breugel, and J.J.M.M. Rutten
Generalized metric spaces: completion, topology, and powerdomains via the Yoneda embedding. Theoretical Computer Science Vol. 193, 1998, pp. 1--51.
[Full paper (in pdf)]
This is a revised version of Technical Report CS-R9636, CWI, Amsterdam, 1996.

D. Turi and J.J.M.M. Rutten
On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Mathematical Structures in Computer Science Vol. 8, 1998, pp. 481--540.

B. Jacobs, L. Moss, H. Reichel and J.J.M.M. Rutten (editors)
Proceedings of First Workshop on Coalgebraic Methods in Computer Science (CMCS '98), ENTCS Volume 11 , Elsevier Science B.V., 1998.

J.J.M.M. Rutten
Relators and Metric Bisimulations (Extended Abstract), in ENTCS Volume 11 , Elsevier Science B.V., 1998.

J.J.M.M. Rutten
Automata and coinduction (an exercise in coalgebra). Technical Report SEN-R9803, CWI, Amsterdam, 1998.
[Abstract] [Full Paper (in compressed PostScript)]
Also in: Proceedings of CONCUR '98, D. Sangiorigi and R. de Simone (eds.), LNCS 1466, Springer, 1998, pp. 194-218.

J.J.M.M. Rutten
Weighted colimits and formal balls in generalized metric spaces.
Topology and its Applications, Volume 89, 1998, pp. 179-202.

1997:

J.J.M.M. Rutten
Weighted colimits and formal balls in generalized metric spaces. Technical Report SEN-R9711, CWI, Amsterdam, 1997.
[Abstract] [Full Paper (in compressed PostScript)]
Also in: Topology and its Applications, Volume 89, 1998, pp. 179-202.

E.P. de Vink and J.J.M.M. Rutten
Bisimulation for probabilistic transition systems: a coalgebraic approach (extended abstract). Proceedings of ICALP'97 (P. Degano et al, eds.). LNCS Vol. 1256, 1997, pp. 460-470. See also Technical Report SEN-R9825, CWI, Amsterdam, 1998. An extended version appeared in Theoretical Computer Science Vol. 221(1-2) (see 1999 above).

B. Jacobs and J.J.M.M. Rutten
A Tutorial on (Co)Algebras and (Co)Induction. Bulletin of EATCS Vol. 62, 1997, pp. 222--259.
[Full Paper (in compressed PostScript)]

1996:

M.M. Bonsangue, F. van Breugel, and J.J.M.M. Rutten
Generalized metric spaces: completion, topology, and powerdomains via the Yoneda embedding. Technical Report CS-R9636, CWI, Amsterdam, 1996. This reports extends the results of CS-R9560 to the case of generalized metric spaces.
[Abstract] [Full Paper (in compressed PostScript)]
A revised version of this report (in which some errors are corrected) appeared in `Theoretical Computer Science' (see 1998, above).

J.J.M.M. Rutten
Universal coalgebra: a theory of systems. Technical Report CS-R9652, CWI, Amsterdam, 1996.
[Abstract] [Full Paper (in compressed PostScript)]
A revised and extended version of this report will appear in Theoretical Computer Science.

M.M. Bonsangue, F. van Breugel, and J.J.M.M. Rutten
Alexandroff and Scott Topologies for Generalized Metric Spaces. In: Papers on General Topology and Applications: Eleventh Summer Conference at University of Southern Maine (S. Andima et al., eds.), Annals of the New York Academy of Sciences, 1996, pp. 49-68.
A preliminary version appeared as Technical Report IR-394, Vrije Universiteit, Amsterdam, 1995.

J.J.M.M. Rutten
Elements of generalized ultrametric domain theory. Theoretical Computer Science, Vol. 170, 1996, pp. 349--381.
(Revised version of report CS-R9507, CWI, Amsterdam, 1995.)

1995:

J.J.M.M. Rutten
A calculus of transition systems (towards universal coalgebra). Technical Report CS-R9503, CWI, Amsterdam, 1995.
[Abstract] [Full Paper (in compressed PostScript)]
Also appeared in: Modal Logic and Process Algebra, a bisimulation perspective (A. Ponse, M. de Rijke, and Y. Venema, eds.), CSLI Lecture Notes No. 53, CSLI Publications, Standford, 1995, pp. 231--256.
The results of this paper have been generalized in Technical Report CS-R9652 (see above).

J.J.M.M. Rutten
Elements of generalized ultrametric domain theory. Technical Report CS-R9507, CWI, Amsterdam, 1995.
[Abstract] [Full Paper (in compressed PostScript)]
A revised version of this report has appeared in Theoretical Computer Science, Vol. 170, 1996, pp. 349--381.

F. Alessi, P. Baldan, G. Belle, and J.J.M.M. Rutten
Solutions of functorial and non-functorial metric domain equations, in ENTCS Volume 1 , Elsevier Science B.V., 1995.

P. Gastin and J.J.M.M. Rutten (editors)
Selected papers of the workshop on topology and completion in semantics, Chartres. Special issue of Theoretical Computer Science, Vol. 151(1), 1995.

M.M. Bonsangue, F. van Breugel, and J.J.M.M. Rutten
Generalized ultrametric spaces: completion, topology, and powerdomains via the Yoneda embedding. Technical Report CS-R9560, CWI, Amsterdam, 1995.
[Abstract] [Full Paper (in compressed PostScript)]