نتایج جستجو برای: uppaal
تعداد نتایج: 600 فیلتر نتایج به سال:
Uppaal is a new tool suit for automatic verification of networks of timed automata. In this paper we describe the diagnostic model-checking feature of Uppaal and illustrates its usefulness through the debugging of (a version of) the Philips Audio-Control Protocol. Together with a graphical interface of Uppaal this diagnostic feature allows for a number of errors to be more easily detected and c...
Uppaal is a tool-set for the design and analysis of real-time systems. In 6] a relatively complete description of Uppaal before 1997 has been given. This paper is focused on the most recent developments and also to complement the paper of 6]. The rst prototype of Uppaal, named Tab at the time, was developed at Uppsala University in 1993 by Wang Yi et al. Its theoretical foundation was presented...
In recent years there has been a considerable effort in optimising formal methods for application to code. This driven by tools such as CPAChecker, DIVINE, and CBMC. At the same time Uppaal have massively expanding realm of more traditional model checking technologies include strategy synthesis algorithms - an aspect becoming needed software becomes increasingly parallel. Instead reimplementing...
Timing aspects are important for the correctness of safety-critical systems. It is crucial that they are carefully analysed in designing such systems. UPPAAL is a tool designed to automate the analysis process. In UPPAAL, a system under construction is described as a network of timed automata and the desired properties of the system can be specified using a query language. Then UPPAAL can be us...
Formal methods that are easy to use but with limited flexibility are sometimes criticized as inefficient and ineffective. This report took a detailed look at UPPAAL1 [1], a toolbox for modeling, simulating and verifying real-time systems, that is jointly developed by Uppsala University and Aalborg University. Specifically, components of the UPPAAL toolbox, the modeling language and the verifica...
Timed automata, priced timed automata and energy automata have emerged as useful formalisms for modeling a real-time and energy-aware systems as found in several embedded and cyber-physical systems. Whereas the real-time model checker UPPAAL allows for efficient verification of hard timing constraints of timed automata, model checking of priced timed automata and energy automata are in general ...
Duration Probabilistic Automata (DPA) is a formalism for modelling concurrent execution of sequences of tasks. This formalism is well suited for scheduling problems such as job shop. We show how DPAs can be translated to other formalisms and how statistical modelchecking can be applied. The performance of these translations is tested using the tools Uppaal and PRISM. The results show that the U...
Modest is a high-level compositional modelling language for stochastic timed systems with a formal semantics in terms of stochastic timed automata, an overarching formalism of which several well-studied models are special cases. The emphasis of Modest is to make use of existing analysis techniques and tools in a single-formalism, multiplesolution approach. In this paper, we focus on networks of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید