Sciweavers

11 search results - page 2 / 3
» Tile Transition Systems as Structured Coalgebras
Sort
View
ENTCS
2002
76views more  ENTCS 2002»
13 years 4 months ago
A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras
In [19] Rutten introduced the notion of weak bisimulations and weak bisimilarity for coalgebras of the functor F(X) = X +O. In the present paper I will introduce a notion of weak ...
Jan Rothe
IANDC
2006
126views more  IANDC 2006»
13 years 4 months ago
Coalgebraic semantics for timed processes
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 "t...
Marco Kick, John Power, Alex Simpson
FSTTCS
2010
Springer
13 years 2 months ago
Generalizing the powerset construction, coalgebraically
a is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behav...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...
FCCM
2004
IEEE
152views VLSI» more  FCCM 2004»
13 years 8 months ago
Implementing and Evaluating Stream Applications on the Dynamically Reconfigurable Processor
Dynamically Reconfigurable Processor (DRP)[1] developed by NEC Electronics is a coarse grain reconfigurable processor that selects a data path from the on-chip repository of sixte...
Noriaki Suzuki, Shunsuke Kurotaki, Masayasu Suzuki...
CONCUR
2005
Springer
13 years 10 months ago
Deriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...