Showing papers by "Jean-François Raskin published in 2001"
20 Aug 2001
TL;DR: A verification method based on the idea that non-repudiation protocols are best modeled as games is proposed, which uses alternating transition systems and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure.
Abstract: In this paper, we report on a recent work for the verification of non-repudiation protocols. We propose a verification method based on the idea that non-repudiation protocols are best modeled as games. To formalize this idea, we use alternating transition systems, a game based model, to model protocols and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure. This method is automated by using the model-checker MOCHA, a model-checker that supports the alternating transition systems and the alternating temporal logic. Several optimistic protocols are analyzed using MOCHA.
92 citations
18 Jul 2001
TL;DR: A new symbolic model checking algorithm for parameterized concurrent systems modeled as (Lossy) Petri Nets, and (L Lossy) Vector Addition Systems is proposed, based on a rich assertional language based on the graph-based symbolic representation of upward-closed sets introduced in [DR00].
Abstract: We propose a new symbolic model checking algorithm for parameterized concurrent systems modeled as (Lossy) Petri Nets, and (Lossy) Vector Addition Systems, based on the following ingredients: a rich assertional language based on the graph-based symbolic representation of upward-closed sets introduced in [DR00], the combination of the backward reachability algorithm of [ACJT96] lifted to the symbolic setting with a new heuristic rule based on structural properties of Petri Nets. We evaluate the method on several Petri Nets and parameterized systems taken from the literature [ABC+95, EM00, Fin93, MC99], and we compare the results with other finite and infinite-state verification tools.
31 citations
Posted Content•
TL;DR: Five increasingly comprehensive classes of infinite-state systems, called STS1--STS5, whose state spaces have finitary structure are defined, which enables model checking of all ω-regular properties, including linear temporal logic.
Abstract: We define five increasingly comprehensive classes of infinite-state systems, called STS1--5, whose state spaces have finitary structure. For four of these classes, we provide examples from hybrid systems.
4 citations
TL;DR: A symbolic tableau-based model generation decision procedure in ECL FC is presented, which is theoretically optimal, but in practice however, it is seen that the introduction of integer-valued prophecy variables will make it more efficient.