The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
The lack of precise numerical information for the values of biological parameters severely limits the development and analysis of models of genetic regulatory networks. To deal wit...