The joint work between ISCAS, University of Liverpool, and University of Technology Sydney about model checking probabilistic epistemic logic for probabilistic multiagent systems has been accepted in IJCAI’18.
The joint work between ISCAS, Academia Sinica, University of Freiburg, and Brno University of Technology about advanced automata-based algorithms for program termination checking has been accepted in PLDI’18.
The joint work between ISCAS and University of Liverpool about learning to complement Büchi automata has been accepted in VMCAI’18.
The SETTA paper about the polynomial-time alternating probabilistic bisimulation for interval MDPs has been awarded with the SETTA’17 best paper award.
The joint work between ISCAS, SAU, and Masdar Institute of Science and Technology about the polynomial-time alternating probabilistic bisimulation for interval MDPs and the joint work between ISCAS and East China Normal University about equivalence checking of nondeterministic finite automata…
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.