15 Result(s)
-
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...
-
Article
Open AccessA 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 ...
-
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...
-
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...
-
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 ...
-
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...
-
Chapter and Conference Paper
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract)
Formal power series are functions σ: A* → k from the set of words over some alphabet A to some semiring k. Examples include formal languages (k = {0; 1}) and power series in classical analysis (k=ℝ, viewing the e...
-
Chapter and Conference Paper
Automata and coinduction (an exercise in coalgebra)
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 a transparent...
-
Chapter and Conference Paper
Bisimulation for probabilistic transition systems: A coalgebraic approach
The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel and Mendier in terms of a set fu...
-
Chapter and Conference Paper
On blocks: locality and asynchronous communication
A general construct for locality in languages based on asynchronous communication is introduced which allows a uniform semantic description of such apparently diverse notions as the introduction of local varia...
-
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...
-
Chapter and Conference Paper
The failure of failures in a paradigm for asynchronous communication
We develop a general framework for a variety of concurrent languages all based on asynchronous communication, like data flow, concurrent logic, concurrent constraint languages and CSP with asynchronous channel...
-
Chapter and Conference Paper
From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic
The main purpose of the paper is to relate different models for Horn Clause Logic: operational, denotational, declarative. We study their relationship by contrasting models based on interleaving, on the one ha...
-
Chapter and Conference Paper
Correctness and full abstraction of metric semantics for concurrency
Four different semantic models are given for a simple uniform programming language, containing constructs for parallel composition, global nondeterminism and communication: linear semantics, failure semantics,...
-
Chapter and Conference Paper
Contractions in comparing concurrency semantics
We define for a simple concurrent imperative language both operational and denotational semantic models as fixed points of contractions on complete metric spaces. Next, we develop a general method for comparin...
