Deciding Weak Weighted Bisimulation

Marino Miculan, Marco Peressotti

Research output: Contribution to journalConference articleResearchpeer-review

20 Downloads (Pure)

Abstract

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.
Original languageEnglish
JournalCEUR Workshop Proceedings
Volume1949
Pages (from-to)126-137
ISSN1613-0073
Publication statusPublished - 2017
Event18th 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, Italy
Duration: 26. Sep 201728. Sep 2017

Conference

Conference18th 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)
CountryItaly
CityNaples
Period26/09/201728/09/2017

Fingerprint

Linear equations

Cite this

Miculan, Marino ; Peressotti, Marco. / Deciding Weak Weighted Bisimulation. In: CEUR Workshop Proceedings. 2017 ; Vol. 1949. pp. 126-137.
@inproceedings{650ddfad9a6e4305a7c9402b18306e56,
title = "Deciding Weak Weighted Bisimulation",
abstract = "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.",
author = "Marino Miculan and Marco Peressotti",
year = "2017",
language = "English",
volume = "1949",
pages = "126--137",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "ceur workshop proceedings",

}

Deciding Weak Weighted Bisimulation. / Miculan, Marino; Peressotti, Marco.

In: CEUR Workshop Proceedings, Vol. 1949, 2017, p. 126-137.

Research output: Contribution to journalConference articleResearchpeer-review

TY - GEN

T1 - Deciding Weak Weighted Bisimulation

AU - Miculan, Marino

AU - Peressotti, Marco

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

M3 - Conference article

VL - 1949

SP - 126

EP - 137

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -