Structural Operational Semantics for Continuous State Probabilistic Processes
We consider the problem of modeling syntax and semantics of probabilistic processes with continuous states (e.g. with continuous data). Syntax and semantics of these systems can be defined as algebras and coalgebras of suitable endofunctors over Meas, the category of measurable spaces. In order to give a more concrete representation for these coalgebras, we present an SOS-like rule format which induces an abstract GSOS over Meas; this format is proved to yield a fully abstract universal semantics, for which behavioural equivalence is a congruence.
To this end, we solve several problems. In particular, the format has to specify how to compose the semantics of processes (which basically are continuous state Markov processes). This is achieved by defining a language of measure terms, i.e., expressions specifically designed for describing probabilistic measures. Thus, the transition relation associates processes with measure terms.
As an example application, we model a CCS-like calculus of processes placed in an Euclidean space. The approach we follow in this case can be readily adapted to other quantitative aspects, e.g. Quality of Service, physical and chemical parameters in biological systems, etc.
- 1.Abbott, E.A.: Flatland: A Romance of Many Dimensions. Blackwell (1884)Google Scholar
- 6.Bartels, F.: On Generalised Coinduction and Probabilistic Specification Formats: Distributive Laws in Coalgebraic Modelling. PhD thesis, CWI, Amsterdam (2004)Google Scholar
- 7.Bartels, F., Sokolova, A., de Vink, E.P.: A hierarchy of probabilistic system types. Electr. Notes Theor. Comput. Sci. 82(1) (2003)Google Scholar
- 11.Cardelli, L., Mardare, R.: The measurable space of stochastic processes. In: Proc. QEST, pp. 171–180. IEEE Computer Society (2010)Google Scholar
- 16.Doberkat, E.-E.: Stochastic relations: foundations for Markov transition systems. Chapman & Hall/CRC Studies in Informatics Series. Chapman & Hall/CRC (2007)Google Scholar
- 19.Hillston, J.: Process algebras for quantitative analysis. In: Proc. LICS, pp. 239–248. IEEE Computer Society (2005)Google Scholar
- 21.Kurz, A.: Logics for Coalgebras and Applications to Computer Science. PhD thesis, Ludwig-Maximilians-Universität München (2000)Google Scholar
- 24.Panangaden, P.: Labelled Markov Processes. Imperial College Press (2009)Google Scholar
- 25.Plotkin, G.D.: A structural approach to operational semantics. DAIMI FN-19, Computer Science Department, Århus University, Århus (1981)Google Scholar
- 28.Staton, S.: Relating coalgebraic notions of bisimulation. Logical Methods in Computer Science 7(1) (2011)Google Scholar
- 29.Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proc. 12th LICS Conf., pp. 280–291. IEEE Computer Society Press (1997)Google Scholar