#### Filter Results:

#### Publication Year

2009

2014

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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)

- Peter E. Bulychev, Alexandre David, Kim G. Larsen, Axel Legay, Guangyuan Li, Danny Bøgsted Poulsen +1 other
- 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)

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)

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)

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)

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)

Statistical Model Checking (SMC) is a trade-off between testing and formal verification. The core idea of the approach is to conduct some simulations of the system and verify if they satisfy some given property. In this paper we show that SMC is easily parallelizable on a master/slaves architecture by introducing a series of algorithms that scale almost… (More)

In this paper we offer an efficient controller synthesis algorithm for assume-guarantee specifications of the form ϕ 1 ∧ ϕ 2 ∧ · · · ∧ ϕn → ψ 1 ∧ ψ 2 ∧ · · · ∧ ψm. Here, {ϕ i , ψ j } are all safety-MTL 0,∞ properties, where the subformulas {ϕ i } are supposed to specify assumptions of the environment and the subformulas {ψ j } are specifying requirements to… (More)

We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible… (More)