Results 1  10
of
38
A tutorial on uppaal
, 2004
"... This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavor of timed automata implemented in the tool, to present its interface, and to explain how to use the tool. The contribution of the paper is to provide reference examples and modeling patterns. ..."
Abstract

Cited by 311 (19 self)
 Add to MetaCart
(Show Context)
This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavor of timed automata implemented in the tool, to present its interface, and to explain how to use the tool. The contribution of the paper is to provide reference examples and modeling patterns.
Is your Model Checker on Time?  On the Complexity of Model Checking for Timed Modal Logics
, 2001
"... This paper studies the structural complexity of model checking for several timed modal logics presented in the literature. More precisely, we consider (variations on) the specification formalisms used in the tools CMC and Uppaal, and fragments of a timed calculus. For each of the logics, we charact ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
This paper studies the structural complexity of model checking for several timed modal logics presented in the literature. More precisely, we consider (variations on) the specification formalisms used in the tools CMC and Uppaal, and fragments of a timed calculus. For each of the logics, we characterize the computational complexity of model checking, as well as its specification and program complexity, using (parallel compositions of) timed automata as our system model. In particular, we show that the complexity of model checking for a timed calculus interpreted over (networks of) timed automata is EXPTIMEcomplete, no matter whether the complexity is measured with respect to the size of the specification, of the model or of both. All the flavours of model checking for timed versions of HennessyMilner logic, and the restricted fragments of the timed µcalculus studied in the literature on CMC and Uppaal, are shown to be PSPACEcomplete or EXPTIMEcomplete. Amongst the complexity results o ered in the paper is a theorem to the effect that the model checking problem for the sublanguage L s of the timed calculus, proposed by Larsen, Pettersson and Yi, is PSPACEcomplete. This result is accompanied by an array of statements showing that any extension of L s has an EXPTIMEcomplete model checking problem. We also argue that the model checking problem for the timed propositional µcalculus T is EXPTIMEcomplete, thus improving upon results by Henzinger, Nicollin, Sifakis and Yovine.
From Qualitative to Quantitative Analysis of Timed Systems. Mémoire d’habilitation, Université Paris 7
, 2009
"... (rapporteur) (rapporteur) (rapporteur) This thesis is mostly based on joint works with: ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(rapporteur) (rapporteur) (rapporteur) This thesis is mostly based on joint works with:
Symbolic Unfoldings for Networks of Timed Automata
, 2006
"... Abstract. In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete fi ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network. 1
A Tutorial on Uppaal 4.0
, 2006
"... This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavour of timed automata implemented in the tool, to present its interface, and to explain how to use the tool. The contribution of the paper is to provide reference examples and modelling patterns. ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavour of timed automata implemented in the tool, to present its interface, and to explain how to use the tool. The contribution of the paper is to provide reference examples and modelling patterns.
Modal logics for timed control
, 2005
"... Abstract. In this paper we use the timed modal logic Lν to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a modelchecking problem for an extension (L cont ν) of the logic Lnu with a new modality. More precisely we defi ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. In this paper we use the timed modal logic Lν to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a modelchecking problem for an extension (L cont ν) of the logic Lnu with a new modality. More precisely we define a fragment of Lν, namely L det ν, such that any formula that holds for the plant if and only if there is a controller that can enforce the control objective. We also show that the new modality of L cont ν strictly increases the expressive power of Lν while modelchecking of Lc remains EXPTIMEcomplete. control objective of L det ν can be translated into a L cont ν 1
Model Checking Timed Automata
"... Currently, formal verification of reactive, critical or embedded systems is a crucial problem, and automatic verification, more specifically model checking, has been widely developed during the last 20 years (see [CLA 99, SCH 01] for surveys). In this approach, we build a formal model M (e.g. an aut ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Currently, formal verification of reactive, critical or embedded systems is a crucial problem, and automatic verification, more specifically model checking, has been widely developed during the last 20 years (see [CLA 99, SCH 01] for surveys). In this approach, we build a formal model M (e.g. an automaton, Petri net, etc.) describing
Testing HennessyMilner Logic with Recursion
 Foundations of Software Science and Computation Structures: Second International Conference, FoSSaCS ’99 Proceedings, LNCS
, 1998
"... This study oers a characterization of the collection of properties expressible in HennessyMilner Logic (HML) with recursion that can be tested using nite LTSs. In addition to actions used to probe the behaviour of the tested system, the LTSs that we use as tests will be able to perform a disting ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This study oers a characterization of the collection of properties expressible in HennessyMilner Logic (HML) with recursion that can be tested using nite LTSs. In addition to actions used to probe the behaviour of the tested system, the LTSs that we use as tests will be able to perform a distinguished action nok to signal their dissatisfaction during the interaction with the tested process. A process s passes the test T i T does not perform the action nok when it interacts with s. A test T tests for a property in HML with recursion i it is passed by exactly the states that satisfy . The paper gives an expressive completeness result oering a characterization of the collection of properties in HML with recursion that are testable in the above sense.
Modeldriven Development and Analysis of High Assurance Systems
, 2006
"... Capturing, refining, and analyzing requirements are some of the most challenging tasks in building a software system. How well these tasks are performed significantly impacts the quality of the developed software system. The difficulty of these tasks is greatly exacerbated for the software of embedd ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Capturing, refining, and analyzing requirements are some of the most challenging tasks in building a software system. How well these tasks are performed significantly impacts the quality of the developed software system. The difficulty of these tasks is greatly exacerbated for the software of embedded systems, since these systems are commonly used for critical applications, have to operate reliably for long periods of time, and need to adhere to realtime constraints. In this dissertation, we introduce a modeling and analysis approach for centralized and distributed realtime embedded systems that supports the use of formal specifications and model checking. The approach comprises four main elements: First, we developed specification patterns for specifying realtime properties to aid the developer in formally specifying critical realtime system properties. Second, to enhance the accessibility of the specification patterns, we developed natural language representation and specification capabilities for qualitative and realtime properties. Third, based on industrial project information, we developed object analysis patterns to facilitate the creation of UML analysis models of embedded systems. Fourth, we defined an iterative modeling and analysis
An Architecture for Automated QoS Resolution in Wireless Systems
 Proceeding of the IEEE International Workshop on Web and Mobile Information Systems (WAMIS
, 2005
"... Abstract: The pervasive nature of mobile and wireless systems has led to increased concerns over Quality of Service (QoS). In the prevailing models for QoS management, QoS resolution is achieved by table lookup, a feature that makes table access the focal point of activity. This approach suffers fr ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
Abstract: The pervasive nature of mobile and wireless systems has led to increased concerns over Quality of Service (QoS). In the prevailing models for QoS management, QoS resolution is achieved by table lookup, a feature that makes table access the focal point of activity. This approach suffers from two limitations, namely, an inability to deal with unexpected QoS requests, and a reliance on human intervention for update of information. This paper is concerned with the presentation of an architecture for supporting automated QoS resolution through verification. The architecture is modular and the QoS resolution function is performed by a subsidiary component, which combines knowledge base with resolution mechanism. This separation of concerns and the support for flexible QoS management has the advantage of