Behavioural Differential Equations and Coinduction for Binary Trees (2008)
Abstract. We study the set TA of infinite binary trees with nodes labelledinasemiringA from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact that TA...
Behavioural Differential Equations and Coinduction for Binary Trees (2008)
Abstract. We study the set TA of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact...
Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica (2007)
Mieke Brune, Jan Willem Klop, Jan Rutten (eds.), Van De Redactie, Samenstelling Bestuur, ...
s van voordrachten On Notions of bisimulation and associated logics Prof.dr. M. Nielsen BRICS, Computer Science Department, University of Aarhus Recently, there have been several attempts of abstract...
Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications (2005)
Farhad Arbab, Christel Baier, Frank De Boer, Jan Rutten, Marjan Sirjani
Composition of a concurrent system out of components involves coordination of their mutual interactions. In component-based construction, this coordination becomes the responsibility of the glue-code...
Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications (2004)
Farhad Arbab, Christel Baier, Frank De Boer, Jan Rutten, Marjan Sirjani
Composition of a concurrent system out of components involves coordination of their mutual interactions. In component-based construction, this coordination becomes the responsibility of the glue-code...
Modeling Component Connectors in Reo by Constraint Automata (Extended Abstract) (2004)
Farhad Arbab, Christel Baier, Jan Rutten, Marjan Sirjani A
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...
Models and Temporal Logics for Timed Component Connectors (2004)
Farhad Arbab, Christel Baier, Frank De Boer, Jan Rutten
The coordination language Reo supports compositional system construction through connectors with real-time properties that exogenously coordinate the interactions among the constituent components...
Modeling Component Connectors in Reo by Constraint Automata (2004)
Christel Baier, Marjan Sirjani, Farhad Arbab, Jan Rutten
In this paper we introduce constraint automata and propose them as an operational model for Reo, an exogenous coordination language for compositional construction of component connectors based on a...
Daniele Turi, Jan Rutten, Partial Orders, Metric Spaces
ion) Given a coalgebraic operational model [[-]] : Prog ! B(Prog) of a language with programs P 2 Prog and behaviour B such that pullbacks lift to B-bisimulations (as, eg, in Proposition 4.4), two...
A Tutorial on (Co)Algebras and (Co)Induction (1997)
. Algebraic structures which are generated by a collection of constructors--- like natural numbers (generated by a zero and a successor) or finite lists and trees--- are of well-established...
Initial algebra and final coalgebra semantics for concurrency (1994)
D. Turi, Jan Rutten, Daniele Turi
The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and...
D. Turi, Jan Rutten, Daniele Turi
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...