The joint work between ISCAS, SAU, and Masdar Institute of Science and Technology about the multi-objective polynomial-time alternating probabilistic bisimulation for interval MDPs and the joint work between ISCAS and East China Normal University about equivalence checking of nondeterministic…
The joint work between ISCAS and University of Technology Sydney about model checking ω-regular properties for Markov quantum chains has been accepted in CONCUR’17.
The joint work between ISCAS, SAU, and Oxford University about multi-objective robust strategy synthesis for interval MDPs has been accepted at QEST’17.
The joint work between ISCAS and RWTH, together with the Universidad Nacional de Cordoba and the University of Twente, about JANI, a quantitative model and tool interaction specification has been accepted at TACAS’17. Also the ISCAS work, together with Academia Sinica,…
The joint work between ISCAS and the University of Liverpool about a recursive algorithm for synthesising strategy improvements for solving quantitative probabilistic parity games has been accepted at VMCAI’17.
The work from ISCAS about using unambiguous Büchi automata for an efficient synthesis algorithm for parametric Markov chains agains linear time properties has been accepted at SETTA’16.
The joint work between ISCAS and SAU about exploiting robust optimization for interval probabilistic bisimulation has been accepted at QEST’16.
The joint work between ISCAS and the University of Liverpool about a simple algorithm for solving qualitative probabilistic parity games has been accepted at CAV’16. Moreover, it has received the “Artifact Evaluated Stamp”.
ISCAS and SAU have jointly worked on deciding probabilistic automata weak bisimulation: theory and practice; the resulting paper has been accepted in the journal Formal Aspects of Computing.
The joint work between ISCAS and SAU about the compositional bisimulation minimization for interval Markov decision processes has been accepted at LATA’16.