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...
We study the problem of statistical model checking of probabilistic systems for PCTL unbounded until property P1p(ϕ1 U ϕ2) (where 1 ∈ {<, ≤, >, ≥}) using the computa...
Ru He, Paul Jennings, Samik Basu, Arka P. Ghosh, H...
This paper introduces AgentSpeak(F), a variation of the BDI logic programming language AgentSpeak(L) intended to permit the model-theoretic verification of multi-agent systems. A...
Rafael H. Bordini, Michael Fisher, Carmen Pardavil...
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...