6 citations · 12 across the 5 of their papers we have counts for
5 papers
A Symbolic Algorithm for the Case-Split Rule in Solving Word Constraints with Extensions (Technical Report)
Yu-Fang Chen, Vojtěch Havlena, Ondřej Lengál +1
Case split is a core proof rule in current decision procedures for the theory of string constraints. Its use is the primary cause of the state space explosion in string constraint…
Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition
Yong Li, Andrea Turrini, Weizhi Feng +2
The determinization of a nondeterministic Büchi automaton (NBA) is a fundamental construction of automata theory, with applications to probabilistic verification and reactive synth…
Compositional Reasoning for Interval Markov Decision Processes
Vahid Hashemi, Holger Hermanns, Andrea Turrini
Model checking probabilistic CTL properties of Markov decision processes with convex uncertainties has been recently investigated by Puggelli et al. Such model checking algorithms…
Cost Preserving Bisimulations for Probabilistic Automata
Andrea Turrini, Holger Hermanns
Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled…
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
Holger Hermanns, Andrea Turrini
Deciding in an efficient way weak probabilistic bisimulation in the context of Probabilistic Automata is an open problem for about a decade. In this work we close this problem by p…