Structural Operational Semantics for Weighted Transition Systems

Klin, Bartek

doi:10.1007/978-3-642-04164-8_7

Cited by 20 publications

(44 citation statements)

References 21 publications

(35 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The correspondence result shown in [Latella et al 2012] sets the basis for a systematic study of SPCs, within the FuTS framework, based on category theory, and in particular within the coalgebraic framework, similar to what has been done for probabilistic models in [Bartels 2002;Bartels et al 2003;Sokolova and de Vink 2004], for Rated TSs by Klin and Sassone [2008] and WTSs [Klin 2009]. We think this is a promising line of future research which should be undertaken for FuTSs; in particular, the relationship between WTSs Weighted GSOS on one hand and FuTSs and related PCs sematics rules on the other seems an interesting line of research.…”

Section: Discussionsupporting

confidence: 64%

“…A noteworthy result of Klin and Sassone [2008] is that stochastic bisimilarity of SPCs defined using the SGSOS format is guaranteed to be a congruence. This result is generalized by Klin [2009] who studies Weighted Transition Systems (WTSs) and related Weighted GSOS which are proven to induce a congruence. It is shown that Rated TSs as well as LTSs are special cases of WTSs.…”

Section: · 33mentioning

confidence: 84%

See 1 more Smart Citation

A uniform definition of stochastic process calculi

et al. 2013

View full text Add to dashboard Cite

We introduce a unifying framework to provide the semantics of process algebras, including their quantitative variants useful for modeling quantitative aspects of behaviors. The unifying framework is then used to describe some of the most representative stochastic process algebras. This provides a general and clear support for an understanding of their similarities and differences. The framework is based on State to Function Labeled Transition Systems, FuTSs for short, that are state-transition structures where each transition is a triple of the form (s, α, P). The first and the second components are the source state, s, and the label, α, of the transition, while the third component is the continuation function, P, associating a value of a suitable type to each state s . For example, in the case of stochastic process algebras the value of the continuation function on s represents the rate of the negative exponential distribution characterizing the duration/delay of the action performed to reach state s from s. We first provide the semantics of a simple formalism used to describe Continuous-Time Markov Chains, then we model a number of process algebras that permit parallel composition of models according to the two main interaction paradigms (multiparty and one-to-one synchronization). Finally, we deal with formalisms where actions and rates are kept separate and address the issues related to the co-existence of stochastic, probabilistic, and non-deterministic behaviors. For each formalism, we establish the formal correspondence between the FuTSs semantics and its original semantics.

show abstract

Section: Discussionsupporting

confidence: 64%

Section: · 33mentioning

confidence: 84%

A uniform definition of stochastic process calculi

et al. 2013

View full text Add to dashboard Cite

show abstract

“…By instantiating abstract GSOS specifications to other functors one can obtain formats for many types of systems, including, e.g., syntactic formats for probabilistic and weighted transition systems [3,22].…”

Section: Where F X = (Px)mentioning

confidence: 99%

“…It is worthwhile to note that we need to reason up to ≡ E to get (22). Indeed, lfp (ψ), id (t i ) = lfp (ψ), id (u i ) does not hold in general, since t i is only congruent to u i , not necessarily equal.…”

Section: Structural Congruences (As Assignment Rules)mentioning

confidence: 99%

“…Email addresses: jrot@cs.ru.nl (Jurriaan Rot), m.m.bonsangue@liacs.leidenuniv.nl (Marcello Bonsangue) coalgebras provides a mathematical framework for the uniform study of many types of state-based systems, including labelled transition systems but also, e.g., (non)-deterministic automata, stream systems and various types of probabilistic and weighted automata [38,22,3]. In the coalgebraic framework, there is a canonical notion of bisimilarity, which instantiates to the classical definition of (strong) bisimilarity in the case of labelled transition systems.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Structural congruence for bialgebraic semantics

Rot¹,

Bonsangue²

2016

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

It was observed by Turi and Plotkin that structural operational semantics can be studied at the level of universal coalgebra, providing specification formats for well-behaved operations on many different types of systems. We extend this framework with non-structural assignment rules which can express, for example, the syntactic format for structural congruences proposed by Mousavi and Reniers. Our main result is that the operational model of such an extended specification is well-behaved, in the sense that bisimilarity is a congruence and that bisimulation-up-to techniques are sound.

show abstract

Towards General Axiomatizations for Bisimilarity and Trace Semantics

Bernardo

2021

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

Structural Operational Semantics for Weighted Transition Systems

Cited by 20 publications

References 21 publications

A uniform definition of stochastic process calculi

A uniform definition of stochastic process calculi

Structural congruence for bialgebraic semantics

Towards General Axiomatizations for Bisimilarity and Trace Semantics

Contact Info

Product

Resources

About