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 language | English |
|---|---|
| Journal | CEUR Workshop Proceedings |
| Volume | 1949 |
| Pages (from-to) | 126-137 |
| ISSN | 1613-0073 |
| Publication status | Published - 2017 |
| Event | 18th 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. Sept 2017 → 28. Sept 2017 |
Conference
| Conference | 18th 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) |
|---|---|
| Country/Territory | Italy |
| City | Naples |
| Period | 26/09/2017 → 28/09/2017 |
Keywords
- Behavioural theory
- Process calculi
- Quantitative models
- Quantitative methods
- Semantics
- Coalgebraic Semantics
- Coinduction
- Formal methods
- Algorithm design and analysis
- Weak behavioural equivalences