Structural operational semantics for stochastic and weighted transition systems

Klin, Bartek; Sassone, Vladimiro

doi:10.1016/j.ic.2013.04.001

Cited by 23 publications

(50 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover our technique is such that the presence of Markovian delays in the process algebra does not cause a significant modification of the process algebra semantics, in that most of the burden is concentrated in a couple of additional rules which are independent of the particular operators used by the algebra. More precisely, we do not have to introduce an explicit (operator dependent) mechanism to distinguish multiple occurrences of actions as in [11,18], or to intervene in the semantics of every operator as in [7] or to separately define, by induction on term syntax, how rate distribution is calculated using (total) rate information attached to rules as in [9] (which also does not cope with recursion). But more importantly, this opens the new possibility to introduce Markovian delays in complex languages like that of [15] without the need to completely change the semantics from reduction style to labeled style.…”

Section: The Main Ideamentioning

confidence: 99%

“…Finally, techniques exploiting the representation of Markovian transitions collectively as a distribution over a target state space (a traditional approach in the context of probabilistic transition systems, see Giry functor [10] and its generalizations, for instance [20,8,22]) have been used in [7] and in [9] for any Markovian process algebra whose operational rules are in a Markovian extension of the GSOS rule format. These techniques are crucially based on collectively inferring Markovian transitions performable at a certain syntactical level (e.g.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, they are, again, not compatible with using structural congruence ≡ (with commutative and associative laws) during the inference of transitions, as caused by the operational rule of closure w.r.t. ≡ mentioned above, which is not in the GSOS format of [9] (the approach in [9] cannot be used in the presence of such a rule, which is fundamental in reduction semantics). Since there is not a fixed stratification of transition inference, different transitions can be inferred by readjusting the structure of terms via the commutative and associative laws of structural congruence in different ways.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Reduction semantics in Markovian process algebra

Bravetti

2018

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Stochastic (Markovian) process algebra extend classical process algebra with probabilistic exponentially distributed time durations denoted by rates (the parameter of the exponential distribution). Defining a semantics for such an algebra, so to derive Continuous Time Markov Chains from system specifications, requires dealing with transitions labeled by rates. With respect to standard process algebra semantics this poses a problem: we have to take into account the multiplicity of several identical transitions (with the same rate). Several techniques addressing this problem have been introduced in the literature, but they can only be used for semantic definitions that do not exploit a structural congruence relation on terms while inferring transitions. On the other hand, using a structural congruence relation is a useful mechanism that is commonly adopted, for instance, in order to define semantics in reduction style for non-basic process algebras such as the π−calculus or richer ones. In this paper we show how to define semantics for Markovian process algebra when structural congruence is used while inferring transitions and, as an application example, we define the reduction semantics for a stochastic version of the π−calculus. Moreover we show such semantics to be correct with respect to the standard one (defined in labeled operational semantics style).

show abstract

Section: The Main Ideamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reduction semantics in Markovian process algebra

Bravetti

2018

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

show abstract

“…[4]. On deterministic MTS, these operations can be given easily using simple structural operational rules (for such semantics of weighted systems, see for instance [43]). For non-deterministic specifications this is significantly harder; in [10] it is shown that DMTS and NAA permit these operations and, additionally but trivially, disjunction.…”

Section: Specification Theorymentioning

confidence: 99%

Compositionality for quantitative specifications

Fahrenberg¹,

Křetínský

Legay³

et al. 2017

Soft Comput

View full text Add to dashboard Cite

We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how to compute the results of standard operations on the systems, including the quotient (residual), which has not been previously considered for quantitative non-deterministic systems. Our quantitative framework has close connections to the modal nu-calculus and is compositional with respect to general notions of distances between systems and the standard operations.

show abstract

“…Götz et al [10] have used stochastic process algebra in studying correctness and performance analysis of multiprocessors and distributed system design. Klin and Sassone [15,16] have explored using monoidal structures for stochastic SOS, an elegant approach that unifies various different operational semantic models into a single algebraic frame. This approach has been taken further by Bernardo et al [7] in finding a unifying structure for dealing with probabilistic, stochastic and time-dependent nondeterminism.…”

Section: Related Workmentioning

confidence: 99%

Best-by-Simulations: A Framework for Comparing Efficiency of Reconfigurable Multicore Architectures on Workloads with Deadlines

Prasad

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Energy consumption is a major concern in multicore systems. Perhaps the simplest strategy for reducing energy costs is to use only as many cores as necessary while still being able to deliver a desired quality of service. Motivated by earlier work on a dynamic (heterogeneous) core allocation scheme for H.264 video decoding that reduces energy costs while delivering desired frame rates, we formulate operationally the general problem of executing a sequence of actions on a reconfigurable machine while meeting a corresponding sequence of absolute deadlines, with the objective of reducing cost. Using a transition system framework that associates costs (e.g., time, energy) with executing an action on a particular resource configuration, we use the notion of amortised cost to formulate in terms of simulation relations appropriate notions for comparing deadline-conformant executions. We believe these notions can provide the basis for an operational theory of optimal cost executions and performance guarantees for approximate solutions, in particular relating the notion of simulation from transition systems to that of competitive analysis used for, e.g., online algorithms.

show abstract

Structural operational semantics for stochastic and weighted transition systems

Cited by 23 publications

References 13 publications

Reduction semantics in Markovian process algebra

Reduction semantics in Markovian process algebra

Compositionality for quantitative specifications

Best-by-Simulations: A Framework for Comparing Efficiency of Reconfigurable Multicore Architectures on Workloads with Deadlines

Contact Info

Product

Resources

About