Reasoning about bounds in weighted transition systems

Tools

Hansen, Mikkel and Larsen, Kim Guldstrand and Mardare, Radu and Pedersen, Mathias Ruggaard (2018) Reasoning about bounds in weighted transition systems. Logical Methods in Computer Science, 14 (4). 19. ISSN 1860-5974 (https://doi.org/10.23638/LMCS-14(4:19)2018)

[thumbnail of Hansen-etal-LMCS-2018-Reasoning-about-bounds-in-weighted-transition-systems]
Preview
 Text. Filename: Hansen_etal_LMCS_2018_Reasoning_about_bounds_in_weighted_transition_systems.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (524kB)| Preview

Abstract

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 and we identify a complete axiomatization for the logic. Last but not least, we use a tableau method to show that the satisfiability problem for the logic is decidable.

CORE (COnnecting REpositories)