A Complete Approximation Theory for Weighted Transition Systems
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.
KeywordsModal Logic Axiomatic System Finite Model Complete Axiomatization Arbitrary Formula
The authors would like to thank the anonymous reviewers for their useful comments and suggestions. This research was supported by the Danish FTP project ASAP: “Approximate Stochastic Analysis of Processes”, the ERC Advanced Grant LASSO: “Learning, Analysis, Synthesis and Optimization of Cyber Physical Systems” as well as the Sino-Danish Basic Research Center IDEA4CPS.
- 4.Chakraborty, S., Katoen, J.P.: On the satisfiability of some simple probabilistic logics. In: LICS (2016 to appear)Google Scholar
- 9.Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS 1991) (1991)Google Scholar
- 11.Kozen, D., Larsen, K.G., Mardare, R., Panangaden, P.: Stone duality for Markov processes. In: 2013 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS), pp. 321–330, June 2013Google Scholar
- 16.Mardare, R., Cardelli, L., Larsen, K.G.: Continuous Markovian logics-axiomatization and quantified metatheory. Log. Meth. Comput. Sci. 8(4) (2012)Google Scholar