GSOS for non-deterministic processes with quantitative aspects

  title={GSOS for non-deterministic processes with quantitative aspects},
  author={Marino Miculan and Marco Peressotti},
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… 

Figures from this paper

Structural operational semantics for non-deterministic processes with quantitative aspects

Reductions for Transition Systems at Work: Deriving a Logical Characterization of Quantitative Bisimulation

It is shown that this hierarchy of meta-models collapses when studied under the lens of bisimulation-coherent encodings, and a fully abstract Hennessy-Milner-style logic is derived from a fully-abstract logic for FuTSs, i.e., which characterizes quantitative bisimilarity.

Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically

The notion of bisimulation induced by a FuTS is addressed from a coalgebraic point of view, and a correspondence result is established stating that FuTS-bisimilarity coincides with behavioural equivalence of the associated functor.

A Definition Scheme for Quantitative Bisimulation

It is shown that this notion of bisimulation for a FuTS coincides with the coalgebraic notion of behavioral equivalence associated to the functor on Set given by the type of the FuTS.

Structural operational semantics for continuous state stochastic transition systems

Rooted branching bisimulation as a congruence for probabilistic transition systems

A Probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence, based on the approach of Fokkink for the qualitative case is proposed.

Behavioural equivalences for timed systems

This work introduces the first uniform framework for timed behavioural models that encompasses known behavioural equivalences such as timed bisimulations, timed language equivalences as well as their weak and time-abstract counterparts.

Deciding Weak Weighted Bisimulation

This paper presents a general notion of weak weighted bisimulation, which coincides with the usual weak bisimulations in the cases of non-deterministic and fully-probabilistic systems, and proves that these systems admit a unique solution for ω-continuous semirings.

On the trade-off between labels and weights in quantitative bisimulation

It is proved that there is a trade-off between labels and weights: at one extreme lays the class of (unlabelled) weighted transition systems where information is presented using weights only; at the other lays theclass of labelled transition systems (LTSs) where information has been shifted on labels.

Endofunctors modelling higher-order behaviours

This paper shows how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors, solving this circularity which is the essence ofHigher-order behaviours.



Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Process Calculi

It is shown how the resulting model, called ULTraS from Uniform Labeled Transition System, can be naturally used to give semantics to a fully nondeterministic, a fully probabilistic, and a fully stochastic variant of a CSP-like process language.

Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages

A correspondence result is proven stating that FuTS-bisimulation coincides with the behavioral equivalence of the associated functor, providing via the correspondence result coalgebraic justification of the equivalences of these calculi.

State to Function Labelled Transition Systems : A Uniform Framework for Defining Stochastic Process Calculi

  • Computer Science
  • 2011
The semantics for a simple language used to directly describe CTMCs is provided, then a number of calculi that permit parallel composition of models according to the two main communication paradigms are considered and the issues related to co-existence of stochastic and nondeterministic behaviors are discussed.

Tree rules in probabilistic transition system specifications with negative and quantitative premises

This work defines a generalized version of the nt f /nt x format in which quantitative premises and conclusions include nested convex combinations of distributions and develops a proof-theoretic notion for these PTSSs that coincides with the existing stratification-based meaning in case the PTSS is stratifiable.

Bisimulation through Probabilistic Testing

A uniform definition of stochastic process calculi

A unifying framework is introduced to provide the semantics of process algebras, including their quantitative variants useful for modeling quantitative aspects of behaviors, and a number of processAlgebrAs that permit parallel composition of models according to the two main interaction paradigms (multiparty and one-to-one synchronization).

Bisimulation can't be traced

This work forms a general notion of Structured Operational Semantics for processes with Guarded recursion (GSOS), and demonstrates that bisimulation does not agree with trace congruence with respect to any set of GSOS-definable contexts.

CONCUR '90 Theories of Concurrency: Unification and Extension

Partial order semantics of concurrent programs.- SCONE: A simple calculus of nets.- Value-passing in process algebras.- Let's make models.- Ideal specification formalism = expressivity +