GSOS for non-deterministic processes with quantitative aspects

Marino Miculan
(DiMI, University of Udine)
Marco Peressotti
(DiMI, University of Udine)

Recently, some general frameworks have been proposed as unifying theories for processes combining non-determinism with quantitative aspects (such as probabilistic or stochastically timed executions), aiming to provide general results and tools. This paper provides two contributions in this respect. First, we present a general GSOS specification format (and a corresponding notion of bisimulation) for non-deterministic processes with quantitative aspects. These specifications define labelled transition systems according to the ULTraS model, an extension of the usual LTSs where the transition relation associates any source state and transition label with state reachability weight functions (like, e.g., probability distributions). This format, hence called Weight Function SOS (WFSOS), covers many known systems and their bisimulations (e.g. PEPA, TIPP, PCSP) and GSOS formats (e.g. GSOS, Weighted GSOS, Segala-GSOS, among others).

The second contribution is a characterization of these systems as coalgebras of a class of functors, parametric on the weight structure. This result allows us to prove soundness of the WFSOS specification format, and that bisimilarities induced by these specifications are always congruences.

In Nathalie Bertrand and Luca Bortolussi: Proceedings Twelfth International Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL 2014), Grenoble, France, 12-13 April 2014, Electronic Proceedings in Theoretical Computer Science 154, pp. 17–33.
Published: 6th June 2014.

ArXived at: https://dx.doi.org/10.4204/EPTCS.154.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org