Skip to main content

7 Result(s)

within J. J. M. M. Rutten Remove this filter Mathematical Logic and Formal Languages Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Regular Varieties of Automata and Coequations

    In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Llópez, and Rutten to characterize nonempty classes of deterministic automata that are...

    J. Salamanca, A. Ballester-Bolinches… in Mathematics of Program Construction (2015)

  2. Article

    Open Access

    A proof of Moessner’s theorem by coinduction

    We present a coinductive proof of Moessner’s theorem. This theorem describes the construction of the stream (1 n ,2 n ,3 n ...

    M. Niqui, J. J. M. M. Rutten in Higher-Order and Symbolic Computation (2011)

    Download PDF (519 KB) View Article

  3. No Access

    Chapter and Conference Paper

    Coalgebraic Foundations of Linear Systems

    Viewing discrete-time causal linear systems as (Mealy) coalgebras, we describe their semantics, minimization and realisation as universal constructions, based on the final coalgebras of streams and causal stre...

    J. J. M. M. Rutten in Algebra and Coalgebra in Computer Science (2007)

  4. No Access

    Chapter and Conference Paper

    An Application of Stream Calculus to Signal Flow Graphs

    The present paper can be seen as an exercise in the author’s stream calculus [Rut01] and gives a new proof for an existing result about stream circuits. Such circuits are also known under the name of signal fl...

    J. J. M. M. Rutten in Formal Methods for Components and Objects (2004)

  5. No Access

    Chapter and Conference Paper

    A Coinductive Calculus of Component Connectors

    Reo is a recently introduced channel-based model for coordination, wherein complex coordinators, called connectors, are compositionally built out of simpler ones. Using a more liberal notion of a channel, Reo ...

    F. Arbab, J. J. M. M. Rutten in Recent Trends in Algebraic Development Techniques (2003)

  6. No Access

    Chapter and Conference Paper

    Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series

    Regular expressions are a standard means for denoting formal languages that are recognizable by finite automata. Much less familiar is the use of syntactic expressions for (formal) power series. Power series g...

    J. J. M. M. Rutten in Mathematics of Program Construction (2000)

  7. No Access

    Chapter and Conference Paper

    Nonwellfounded sets and programming language semantics

    For a large class of transition systems that are defined by specifications in the SOS style, it is shown how these induce a compositional semantics. The main difference with earlier work on this subject is the...

    J. J. M. M. Rutten in Mathematical Foundations of Programming Semantics (1992)