GSOS for non-deterministic processes with quantitative aspects

14Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Miculan, M., & Peressotti, M. (2014). GSOS for non-deterministic processes with quantitative aspects. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 154, pp. 17–33). Open Publishing Association. https://doi.org/10.4204/EPTCS.154.2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free