GSOS for non-deterministic processes with quantitative aspects
arXiv:1406.2066 · doi:10.4204/EPTCS.154.2
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.
In Proceedings QAPL 2014, arXiv:1406.1567
References in corpus (6)
- Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
- Tree rules in probabilistic transition system specifications with negative and quantitative premises
- Weak bisimulations for labelled transition systems weighted over semirings
- Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Process Calculi
- On coalgebras with internal moves
- Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages
Cited by in corpus (8)
- Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
- A Definition Scheme for Quantitative Bisimulation
- Structural operational semantics for non-deterministic processes with quantitative aspects
- Behavioural equivalences for timed systems
- Rooted branching bisimulation as a congruence for probabilistic transition systems
- Endofunctors modelling higher-order behaviours
- Well-Stratified Linked Data for Well-Behaved Data Citation
- On the trade-off between labels and weights in quantitative bisimulation