Formal Verification of Real-Time Systems with Data Processing

The behavior of practical safety critical systems often combines real-time behavior with structured data flow. To ensure correctness of such systems, both aspects have to be modeled and formally verified. Time related behavior can be efficiently modeled and analyzed in terms of timed automata. At the same time, program verification techniques like abstract interpretation and software model checking can efficiently handle data flow. In this paper, we describe a simple formalism that represents both aspects of such systems in a uniform and explicit way, thus enables the combination of formal analysis methods for real-time systems and software using standard techniques.

Download Full-text

MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS

International Journal of Foundations of Computer Science ◽

10.1142/s0129054112400382 ◽

2012 ◽

Vol 23 (04) ◽

pp. 831-851 ◽

Cited By ~ 2

Author(s):

GUOQIANG LI ◽

XIAOJUAN CAI ◽

SHOJI YUEN

Keyword(s):

Real Time ◽

Timed Automata ◽

Expressive Power ◽

Behavioral Model ◽

Parallel Composition ◽

Real Time Systems ◽

Modeling And Analysis ◽

Compositional System ◽

Time Systems ◽

Timed Automaton

Timed automata are commonly recognized as a formal behavioral model for real-time systems. For compositional system design, parallel composition of timed automata as proposed by Larsen et al. [22] is useful. Although parallel composition provides a general method for system construction, in the low level behavior, components often behave sequentially by passing control via communication. This paper proposes a behavioral model, named controller automata, to combine timed automata by focusing on the control passing between components. In a controller automaton, to each state a timed automaton is assigned. A timed automaton at a state may be preempted by the control passing to another state by a global labeled transition. A controller automaton properly extends the expressive power because of the stack, but this can make the reachability problem undecidable. Given a strict partial order over states, we show that this problem can be avoided and a controller automaton can be faithfully translated into a timed automaton.

Download Full-text

Timed Automata Model for Component-Based Real-Time Systems

2010 17th IEEE International Conference and Workshops on Engineering of Computer Based Systems ◽

10.1109/ecbs.2010.20 ◽

2010 ◽

Cited By ~ 3

Author(s):

Georgiana Macariu ◽

Vladimir Cretu

Keyword(s):

Real Time ◽

Timed Automata ◽

Real Time Systems ◽

Time Systems

Download Full-text

Online On-the-Fly Testing of Real-time Systems

BRICS Report Series ◽

10.7146/brics.v10i49.21821 ◽

2003 ◽

Vol 10 (49) ◽

Cited By ~ 6

Author(s):

Marius Mikucionis ◽

Kim G. Larsen ◽

Brian Nielsen

Keyword(s):

Real Time ◽

Test Generation ◽

Timed Automata ◽

Online Testing ◽

Real Time Systems ◽

Model Checker ◽

Test Specification ◽

And Performance ◽

Automata Network ◽

Time Systems

In this paper we present a framework, an algorithm and a new tool for online testing of real-time systems based on symbolic techniques used in UPPAAL model checker. We extend UPPAAL timed automata network model to a test specification which is used to generate test primitives and to check the correctness of system responses including the timing aspects. We use timed trace inclusion as a conformance relation between system and specification to draw a test verdict. The test generation and execution algorithm is implemented as an extension to UPPAAL and experiments carried out to examine the correctness and performance of the tool. The experiment results are promising.

Download Full-text

Timed-automata based schedulability analysis for distributed firm real-time systems: a case study

International Journal on Software Tools for Technology Transfer ◽

10.1007/s10009-012-0245-y ◽

2012 ◽

Vol 15 (3) ◽

pp. 211-228 ◽

Cited By ~ 7

Author(s):

Thi Thieu Hoa Le ◽

Luigi Palopoli ◽

Roberto Passerone ◽

Yusi Ramadian

Keyword(s):

Real Time ◽

Timed Automata ◽

Schedulability Analysis ◽

Real Time Systems ◽

Time Systems

Download Full-text

Time Petri Nets with Action Duration

International Journal of Embedded and Real-Time Communication Systems ◽

10.4018/jertcs.2013040104 ◽

2013 ◽

Vol 4 (2) ◽

pp. 62-83 ◽

Cited By ~ 9

Author(s):

N. Belala ◽

D.E. Saїdouni ◽

R. Boukharrou ◽

A.C. Chaouche ◽

A. Seraoui ◽

...

Keyword(s):

Petri Nets ◽

Real Time ◽

Timed Automata ◽

Operational Semantics ◽

Time Interval ◽

Timing Constraints ◽

Time Petri Nets ◽

Real Time Systems ◽

High Level ◽

Time Systems

The design of real-time systems needs a high-level specification model supporting at the same time timing constraints and actions duration. The authors introduce in this paper an extension of Petri Nets called Time Petri Nets with Action Duration (DTPN) where time is associated with transitions. In DTPN, the firing of transitions is bound to a time interval and transitions represent actions which have explicit durations. The authors give an operational semantics for DTPN in terms of Durational Action Timed Automata (DATA). DTPN considers both timing constraints and durations under a true-concurrency semantics with an aim of better expressing concurrent and parallel behaviours of real-time systems.

Download Full-text