A Complete Approximation Theory for Weighted Transition Systems

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

3 Citationer (Scopus)
159 Downloads (Pure)

Abstrakt

We propose a way of reasoning about minimal and maximal values of the weights of transitions in a weighted transition system (WTS). This perspective induces a notion of bisimulation that is coarser than the classic bisimulation: it relates states that exhibit transitions to bisimulation classes with the weights within the same boundaries. We propose a customized modal logic that expresses these numeric boundaries for transition weights by means of particular modalities. We prove that our logic is invariant under the proposed notion of bisimulation. We show that the logic enjoys the finite model property which allows us to prove the decidability of satisfiability and provide an algorithm for satisfiability checking. Last but not least, we identify a complete axiomatization for this logic, thus solving a long-standing open problem in this field. All our results are proven for a class of WTSs without the image-finiteness restriction, a fact that makes this development general and robust.
OriginalsprogEngelsk
TitelDependable Software Engineering: Theories, Tools, and Applications : Second International Symposium, SETTA 2016, Beijing, China, November 9-11, 2016, Proceedings
RedaktørerMartin Fränzle, Deepak Kapur, Naijun Zhan
ForlagSpringer
Publikationsdato2016
Sider213-228
ISBN (Trykt)978-3-319-47676-6
ISBN (Elektronisk)978-3-319-47677-3
DOI
StatusUdgivet - 2016
Begivenhed2nd International Symposium on Dependable Software Engineering: Theories, Tools and Applications, SETTA 2016 - Beijing, Kina
Varighed: 9 nov. 201611 nov. 2016

Konference

Konference2nd International Symposium on Dependable Software Engineering: Theories, Tools and Applications, SETTA 2016
LandKina
ByBeijing
Periode09/11/201611/11/2016
NavnLecture Notes in Computer Science
Vol/bind9984
ISSN0302-9743

Fingeraftryk Dyk ned i forskningsemnerne om 'A Complete Approximation Theory for Weighted Transition Systems'. Sammen danner de et unikt fingeraftryk.

  • Projekter

    Approximate Reasoning for Stochastic Markovian Systems

    Mardare, R. & Larsen, K. G.

    01/11/201531/10/2019

    Projekter: ProjektForskning

    IDEA4CPS: Foundations for Cyber-Physical Sytems

    Larsen, K. G., Skou, A., Nielsen, B., Bulychev, P., Ravn, A. P. & Poulsen, D. B.

    01/04/201130/04/2015

    Projekter: ProjektForskning

    Aktiviteter

    • 1 Konferenceoplæg

    2nd International Symposium on Dependable Software Engineering: Theories, Tools and Applications, SETTA 2016

    Mikkel Hansen (Oplægsholder)

    9 nov. 201611 nov. 2016

    Aktivitet: Foredrag og mundtlige bidragKonferenceoplæg

    Citationsformater

    Hansen, M., Larsen, K. G., Mardare, R. I., Pedersen, M. R., & Xue, B. (2016). A Complete Approximation Theory for Weighted Transition Systems. I M. Fränzle, D. Kapur, & N. Zhan (red.), Dependable Software Engineering: Theories, Tools, and Applications: Second International Symposium, SETTA 2016, Beijing, China, November 9-11, 2016, Proceedings (s. 213-228). Springer. Lecture Notes in Computer Science Bind 9984 https://doi.org/10.1007/978-3-319-47677-3_14