On compositions and paths for coalgebras csuni salzburgat关于的构造和路径.pdfVIP

On compositions and paths for coalgebras Ana Sokolova Formal Methods Group Department of Computer Science Technische Universiteit Eindhoven a.sokolova@tue.nl Abstract This report discusses the possibility of defining composed steps and paths in coalgebras. Both of these notions are relevant for defining some semantic relations for coalgebras like weak bisimulation and trace seman- tics. We present some observations, ideas, and small results on the men- tioned topics. 1 Introduction In this report we collect some notes on compositions and paths for coalgebras. We assume familiarity with the theory of coalgebras [Rut96, JR96, Rut00] and with basic category theory (see e.g. [Mac71, Bor94]). As leading examples we consider probabilistic systems. Most of the probabilistic systems are coalgebras of a functor [VR99, Mos99, BSV04, SVW05]. The notions of compositions and paths are remotely related to trace semantics. For some probabilistic systems there is a notion of trace semantics i.e. trace distribution [Seg95a, Seg95b, Bai98]. For coalgebras in general it is difficult to define what traces are. Interesting solutions for some classes of coalgebras have been recently proposed [Jac04, HJ05b, Jac05, HJ05a]. We believe that an important building block for defining trace semantics as well as weak bisimula- tion for coalgebras is the notion of a composite step. In a coalgebra, for each state, the transition function represents the one-step behavior of the state. In order to define traces or weak steps, one needs to consider sequences of steps i.e. composite steps. In Section 2 we discuss how composition of coalgebras, i.e. c