1,271 research outputs found
LTL Parameter Synthesis of Parametric Timed Automata
The parameter synthesis problem for parametric timed automata is undecidable
in general even for very simple reachability properties. In this paper we
introduce restrictions on parameter valuations under which the parameter
synthesis problem is decidable for LTL properties. The investigated bounded
integer parameter synthesis problem could be solved using an explicit
enumeration of all possible parameter valuations. We propose an alternative
symbolic zone-based method for this problem which results in a faster
computation. Our technique extends the ideas of the automata-based approach to
LTL model checking of timed automata. To justify the usefulness of our
approach, we provide experimental evaluation and compare our method with
explicit enumeration technique.Comment: 23 pages, extended versio
Efficient Online Timed Pattern Matching by Automata-Based Skipping
The timed pattern matching problem is an actively studied topic because of
its relevance in monitoring of real-time systems. There one is given a log
and a specification (given by a timed word and a timed automaton
in this paper), and one wishes to return the set of intervals for which the log
, when restricted to the interval, satisfies the specification
. In our previous work we presented an efficient timed pattern
matching algorithm: it adopts a skipping mechanism inspired by the classic
Boyer--Moore (BM) string matching algorithm. In this work we tackle the problem
of online timed pattern matching, towards embedded applications where it is
vital to process a vast amount of incoming data in a timely manner.
Specifically, we start with the Franek-Jennings-Smyth (FJS) string matching
algorithm---a recent variant of the BM algorithm---and extend it to timed
pattern matching. Our experiments indicate the efficiency of our FJS-type
algorithm in online and offline timed pattern matching
Fast algorithms for handling diagonal constraints in timed automata
A popular method for solving reachability in timed automata proceeds by
enumerating reachable sets of valuations represented as zones. A na\"ive
enumeration of zones does not terminate. Various termination mechanisms have
been studied over the years. Coming up with efficient termination mechanisms
has been remarkably more challenging when the automaton has diagonal
constraints in guards.
In this paper, we propose a new termination mechanism for timed automata with
diagonal constraints based on a new simulation relation between zones.
Experiments with an implementation of this simulation show significant gains
over existing methods.Comment: Shorter version of this article to appear in CAV 201
A Systematic Approach to Justifying Sufficient Confidence in Software Safety Arguments
Safety arguments typically have some weaknesses. To show that the overall confidence in the safety argument is considered acceptable, it is necessary to identify the weaknesses associated with the aspects of a safety argument and supporting evidence, and manage them. Confidence arguments are built to show the existence of sufficient confidence in the developed safety arguments. In this paper, we propose an approach to systematically constructing confidence arguments and identifying the weaknesses of the software safety arguments. The proposed approach is described and illustrated with a running example
A Safety Case Pattern for Model-Based Development Approach
In this paper, a safety case pattern is introduced to facilitate the presentation of a correctness argument for a system implemented using formal methods in the development process. We took advantage of our experience in constructing a safety case for the Patient Controlled Analgesic (PCA) infusion pump, to define this safety case pattern. The proposed pattern is appropriate to be instantiated within the safety cases constructed for systems that are developed by applying model-based approaches
Optimal infinite scheduling for multi-priced timed automata
This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules
Timed Automata Semantics for Visual e-Contracts
C-O Diagrams have been introduced as a means to have a more visual
representation of electronic contracts, where it is possible to represent the
obligations, permissions and prohibitions of the different signatories, as well
as what are the penalties in case of not fulfillment of their obligations and
prohibitions. In such diagrams we are also able to represent absolute and
relative timing constraints. In this paper we present a formal semantics for
C-O Diagrams based on timed automata extended with an ordering of states and
edges in order to represent different deontic modalities.Comment: In Proceedings FLACOS 2011, arXiv:1109.239
Simulating hemispatial neglect with virtual reality
<p>Abstract</p> <p>Background</p> <p>Hemispatial neglect is a cognitive disorder defined as a lack of attention for stimuli contra-lateral to the brain lesion. The assessment is traditionally done with basic pencil and paper tests and the rehabilitation programs are generally not well adapted. We propose a virtual reality system featuring an eye-tracking device for a better characterization of the neglect that will lead to new rehabilitation techniques.</p> <p>Methods</p> <p>This paper presents a comparison of eye-gaze patterns of healthy subjects, patients and healthy simulated patients on a virtual line bisection test. The task was also executed with a reduced visual field condition hoping that fewer stimuli would limit the neglect.</p> <p>Results</p> <p>We found that patients and healthy simulated patients had similar eye-gaze patterns. However, while the reduced visual field condition had no effect on the healthy simulated patients, it actually had a negative impact on the patients. We discuss the reasons for these differences and how they relate to the limitations of the neglect simulation.</p> <p>Conclusion</p> <p>We argue that with some improvements the technique could be used to determine the potential of new rehabilitation techniques and also help the rehabilitation staff or the patient's relatives to better understand the neglect condition.</p
Language Emptiness of Continuous-Time Parametric Timed Automata
Parametric timed automata extend the standard timed automata with the
possibility to use parameters in the clock guards. In general, if the
parameters are real-valued, the problem of language emptiness of such automata
is undecidable even for various restricted subclasses. We thus focus on the
case where parameters are assumed to be integer-valued, while the time still
remains continuous. On the one hand, we show that the problem remains
undecidable for parametric timed automata with three clocks and one parameter.
On the other hand, for the case with arbitrary many clocks where only one of
these clocks is compared with (an arbitrary number of) parameters, we show that
the parametric language emptiness is decidable. The undecidability result
tightens the bounds of a previous result which assumed six parameters, while
the decidability result extends the existing approaches that deal with
discrete-time semantics only. To the best of our knowledge, this is the first
positive result in the case of continuous-time and unbounded integer
parameters, except for the rather simple case of single-clock automata
- âŠ