Nothing Special   »   [go: up one dir, main page]

skip to main content
Volume 204, Issue 4April 2006Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Reflects downloads up to 19 Nov 2024Bibliometrics
Skip Table Of Content Section
article
Recursive coalgebras from comonads
Pages 437–468

The concept of recursive coalgebra of a functor was introduced in the 1970s by Osius in his work on categorical set theory to discuss the relationship between wellfounded induction and recursively specified functions. In this paper, we motivate the use ...

article
A modular approach to defining and characterising notions of simulation
Pages 469–502

We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notions of simulation for such systems, and inductive techniques to define the ...

article
Bisimulation and cocongruence for probabilistic systems
Pages 503–523

We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulation, originally due to Larsen and Skou. Event bisimulation uses a sub @s-...

article
Comparing operational models of name-passing process calculi
Pages 524–560

We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic model is considered both for presheaves over the category of finite sets ...

article
Distributive laws for the coinductive solution of recursive equations
Pages 561–587

This paper illustrates the relevance of distributive laws for the solution of recursive equations, and shows that one approach for obtaining coinductive solutions of equations via infinite terms is in fact a special case of a more general approach using ...

article
Coalgebraic semantics for timed processes
Pages 588–609

We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a ''time domain'', and we model processes by ''timed transition systems'', which amount to partial monoid actions of the time domain ...

article
Final coalgebras for functors on measurable spaces
Pages 610–636

We prove that every functor on the category Meas of measurable spaces built from the identity and constant functors using products, coproducts, and the probability measure functor @D has a final coalgebra. Our work builds on the construction of the ...

article
Automata and fixed point logic: A coalgebraic perspective
Pages 637–678

This paper generalizes existing connections between automata and logic to a coalgebraic abstraction level. Let F: Set to Set be a standard functor that preserves weak pullbacks. We introduce various notions of F-automata, devices that operate on pointed ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.