This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences o...
Dirk Walther, Wiebe van der Hoek, Michael Wooldrid...
Breadth and depth complexity are key challenges in achieving business process fusion as the enabler for value configuration design. The PARM framework is proposed as the requiremen...
Currently, large amounts of research exist into the design and implementation of adaptive systems. The complex task of authoring of such systems, or their evaluation, is addressed ...
Modern software applications ranging from enterprise to embedded systems are becoming increasingly complex, and require very high levels of dependability assurance. The most effec...
Zhenbang Chen, Zhiming Liu, Volker Stolz, Lu Yang,...