#### Filter Results:

- Full text PDF available (58)

#### Publication Year

1977

2018

- This year (1)
- Last 5 years (27)
- Last 10 years (55)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Organism

Learn More

- Jan J. M. M. Rutten
- Theor. Comput. Sci.
- 2000

In the semantics of programming, nite data types such as nite lists, have traditionally been modelled by initial algebras. Later nal coalgebras were used in order to deal with in nite data types.â€¦ (More)

- Christel Baier, Marjan Sirjani, Farhad Arbab, Jan J. M. M. Rutten
- Sci. Comput. Program.
- 2006

Reo is an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. Building automated tools to address such concerns as equivalence orâ€¦ (More)

- Jan J. M. M. Rutten
- CONCUR
- 1998

The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads toâ€¦ (More)

- Pierre America, Jan J. M. M. Rutten
- J. Comput. Syst. Sci.
- 1989

This paper presents a technique by which solutions to reflexive domain equations can be found in a certain category of complete metric spaces. The objects in this category are the (non-empty) metricâ€¦ (More)

- Jan J. M. M. Rutten
- Theor. Comput. Sci.
- 2003

We present a theory of streams (in2nite sequences), automata and languages, and formal power series, in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theoryâ€¦ (More)

- Erik P. de Vink, Jan J. M. M. Rutten
- Theor. Comput. Sci.
- 1999

- Jan J. M. M. Rutten, Daniele Turi
- REX School/Symposium
- 1993

The aim of this paper is to relate initial algebra semantics and nal coalgebra semantics It is shown how these two approaches to the semantics of programming languages are each others dual and someâ€¦ (More)

- Jan J. M. M. Rutten, Daniele Turi
- REX Workshop
- 1992

Abs t rac t . Canonical solutions of domain equations are shown to be final coalgebras, not only in a category of non-standard sets (as already known), but also in categories of metric spaces andâ€¦ (More)

- Jan J. M. M. Rutten
- Mathematical Structures in Computer Science
- 2005

We develop a coinductive calculus of streams based on the presence of a final coalgebra structure on the set of streams (infinite sequences of real numbers). The main ingredient is the notion ofâ€¦ (More)

Coalgebra is used to generalize notions and techniques from concurrency theory, in order to apply them to problems concerning the supervisory control of discrete event systems. The main ingredientsâ€¦ (More)