Deciding Weak Weighted Bisimulation

Marino Miculan, Marco Peressotti

Publikation: Bidrag til tidsskriftKonferenceartikelForskningpeer review

33 Downloads (Pure)

Abstrakt

Weighted labelled transition systems are LTSs whose transitions are given weights drawn from a commutative monoid, subsuming a wide range of systems with quantitative aspects. In this paper we extend this theory towards other behavioural equivalences, by considering semirings of weights. Taking advantage of this extra structure, we consider a general notion of weak weighted bisimulation, which coincides with the usual weak bisimulations in the cases of non-deterministic and fully-probabilistic systems. We present a general algorithm for deciding weak weighted bisimulation. The procedure relies on certain systems of linear equations over the semiring of weights hence it can be readily instantiated to a wide range of models. We prove that these systems admit a unique solution for ω-continuous semirings.
OriginalsprogEngelsk
TidsskriftCEUR Workshop Proceedings
Vol/bind1949
Sider (fra-til)126-137
ISSN1613-0073
StatusUdgivet - 2017
Begivenhed18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N) - Naples, Italien
Varighed: 26. sep. 201728. sep. 2017

Konference

Konference18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N)
Land/OmrådeItalien
ByNaples
Periode26/09/201728/09/2017

Fingeraftryk

Dyk ned i forskningsemnerne om 'Deciding Weak Weighted Bisimulation'. Sammen danner de et unikt fingeraftryk.

Citationsformater