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.
Ralf Wimmer and Karina Wimmer, from ALU, visits ISCAS from Oct. 17 to Oct. 27, 2016. During the visit, Ralf gives a course on Symbolic Verification while Karima gives a talk on Dependency Quantified Boolean Formulas and Skolem functions applied…
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.
Lijun Zhang, from ISCAS, visits SAU and RWTH from May 8 to May 14, 2016.
Andrea Turrini, from ISCAS, visits SAU from Apr. 24 to May 01, 2016.
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.
Tom van Dijk, from U.Twente, and Sebastian Junges, from RWTH, attend SETTA 2015 in Nanjing from Nov. 02 to Nov. 05, 2015; then they visit ISCAS until Nov. 15.