#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2007

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Peter E. Bulychev, Alexandre David, +4 authors Zheng Wang
- QAPL
- 2012

This paper offers a survey of UPPAAL-SMC, a major extension of the real-time verification tool UPPAAL. UPPAAL-SMC allows for the efficient analysis of performance properties of networks of priced timed automata under a natural stochastic semantics. In particular, UPPAAL-SMC relies on a series of extensions of the statistical model checking approach… (More)

—This paper describes a new algorithm for finding software clones. It is conceptually independent of the source language of the analyzed programs, working at the level of abstract syntax trees. The algorithm considers that two sequences of statements form a clone if one of them can be obtained from the other by replacing some subtrees. To our knowledge this… (More)

- Peter E. Bulychev, Alexandre David, Kim G. Larsen, Axel Legay, Marius Mikucionis, Danny Bøgsted Poulsen
- NASA Formal Methods
- 2012

- Peter E. Bulychev, Alexandre David, +4 authors Amélie Stainer
- LPAR
- 2012

We present a novel approach and implementation for analysing weighted timed automata (WTA) with respect to the weighted metric temporal logic (WMTL ≤). Based on a stochastic semantics of WTAs, we apply statistical model checking (SMC) to estimate and test probabilities of satisfaction with desired levels of confidence. Our approach consists in generation of… (More)

- Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Zakharov
- Ershov Memorial Conference
- 2009

A term t is called a template of terms t1 and t2 iff t1 = tη1 and t2 = tη2, for some substitutions η1 and η2. A template t of t1 and t2 is called the most specific iff for any template t of t1 and t2 there exists a substitution ξ such that t = t ξ. The anti-unification problem is that of computing the most specific template of two given terms. This problem… (More)

- Peter E. Bulychev, Thomas Chatain, Alexandre David, Kim G. Larsen
- FORMATS
- 2009

In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak alternating simulation as a preorder between timed game automata, which preserves controllability. We define the rules of building a symbolic turn-based two-player game such that the… (More)

—This paper describes an algorithm for finding software clones, which works at the level of abstract syntax trees and is thus conceptually independent of the source language of the analyzed programs. We use a notion of clones which captures replacement of subtrees in the program AST, and is formally based on the notion of anti-unification. This allows us to… (More)

We present a new technique for verifying Weighted Metric Temporal Logic (WMTL) properties of Weighted Timed Automata. Our approach relies on Statistical Model Checking combined with a new monitoring algorithm based on rewriting rules. Contrary to existing monitoring approaches for WMTL ours is exact. The technique has been implemented in the statistical… (More)

The main goal of model checking is to verify whether a model of a given program satisfies some given specification. In this paper models are regarded as fair or ordinary Kripke structures whereas specifications are represented by formulae branching-time temporal logics (CT L * X or ACT L * X). Model checking can be substantially enhanced by reducing the… (More)

This paper studies the problem of computing Nash equilibrium in wireless networks modeled by Weighted Timed Automata. Such formalism comes together with a logic that can be used to describe complex features such as timed energy constraints. Our contribution is a method for solving this problem using Statistical Model Checking. The method has been… (More)