English

GSOS for non-deterministic processes with quantitative aspects

Logic in Computer Science 2014-06-10 v1 Programming Languages

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.

Keywords

Cite

@article{arxiv.1406.2066,
  title  = {GSOS for non-deterministic processes with quantitative aspects},
  author = {Marino Miculan and Marco Peressotti},
  journal= {arXiv preprint arXiv:1406.2066},
  year   = {2014}
}

Comments

In Proceedings QAPL 2014, arXiv:1406.1567

R2 v1 2026-06-22T04:33:41.276Z