scholarly journals Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction*

2021 ◽  
Vol 178 (1-2) ◽  
pp. 31-57
Author(s):  
Franck Cassez ◽  
Peter Gjøl Jensen ◽  
Kim Guldstrand Larsen
Keyword(s):  
Real Time ◽  
State Of The Art ◽  
Timed Automata ◽  
Robustness Analysis ◽  
Hybrid Automata ◽  
Timed Systems ◽  
Current State ◽  
Parameter Synthesis ◽  
Series Of Experiments ◽  
Time Systems

We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. We propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. All of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.

scholarly journals IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

2021 ◽  
pp. 552-565
Author(s):  
Étienne André
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Timed Automata ◽  
Robustness Analysis ◽  
Parametric Model ◽  
Timing Constraints ◽  
Real Time Systems ◽  
Model Checker ◽  
Time Systems ◽  
Timed Model Checking

AbstractReal-time systems are notoriously hard to verify due to nondeterminism, concurrency and timing constraints. When timing constants are uncertain (in early the design phase, or due to slight variations of the timing bounds), timed model checking techniques may not be satisfactory. In contrast, parametric timed model checking synthesizes timing values ensuring correctness. takes as input an extension of parametric timed automata (PTAs), a powerful formalism to formally verify critical real-time systems. extends PTAs with multi-rate clocks, global rational-valued variables and a set of additional useful features. We describe here the new features and algorithms offered by  3, that moved along the years from a simple prototype dedicated to robustness analysis to a standalone parametric model checker for timed systems.

MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS

2012 ◽  
Vol 23 (04) ◽  
pp. 831-851 ◽  
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.

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

2003 ◽  
Vol 10 (49) ◽  
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.

scholarly journals Time Petri Nets with Action Duration

2013 ◽  
Vol 4 (2) ◽  
pp. 62-83 ◽  
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.

Real Time Simulation for High Fidelity Multibody Dynamics and Mechatronic Systems

2014 ◽  
Author(s):  
William Prescott
Keyword(s):  
Real Time ◽  
Multibody Dynamics ◽  
Large Scale ◽  
State Of The Art ◽  
High Fidelity ◽  
Implicit Integration ◽  
Mechatronic Systems ◽  
Vehicle Simulation ◽  
Current State ◽  
Time Simulation

This paper will investigate the use of large scale multibody dynamics (MBD) models for real-time vehicle simulation. Current state of the art in the real-time solution of vehicle uses 15 degree of freedom models, but there is a need for higher-fidelity systems. To increase the fidelity of models uses this paper will propose the use of the following techniques: implicit integration, parallel processing and co-simulation in a real-time environment.

scholarly journals Parameter synthesis for hierarchical concurrent real-time systems

2014 ◽  
Vol 50 (5-6) ◽  
pp. 620-679 ◽  
Author(s):  
Étienne André ◽  
Yang Liu ◽  
Jun Sun ◽  
Jin-Song Dong
Keyword(s):  
Real Time ◽  
Real Time Systems ◽  
Parameter Synthesis ◽  
Time Systems

scholarly journals Hybrid Automata: An Algorithmic Approach Behavioral Hybrid Systems

2019 ◽  
Vol 6 (2) ◽  
pp. 83-90
Author(s):  
Koteswara Rao Ballamudi
Keyword(s):  
Hybrid Systems ◽  
Brain Research ◽  
Timed Automata ◽  
Point Of View ◽  
Hybrid Automata ◽  
Test Bed ◽  
Algorithmic Approach ◽  
Security Properties ◽  
The Right ◽  
Time Systems

Hybrid automata strategies have advanced as a vital tool to design, check and direct the execution of hybrid systems. Any way they can – and we assume should – be utilized to communicate quantitative models about hybrid systems in different areas, for example, experimental sciences. Since the conventional design of hybrid automata compares well to consecutively integrate behavioral chains in living creatures, we look for a use of hybrid modeling procedures in the social sciences and, particularly, brain research. We attempt to address the question related to how human drivers move onto an expressway and simultaneously utilize this study as our test-bed for utilizing hybrid automata inside behavioral sciences. Hybrid automata give a language to displaying and exploring advanced and simple calculations in real-time systems. Hybrid automata are studied here from a dynamical systems point of view. Essential and adequate conditions for the presence and uniqueness of arrangements are inferred and a class of hybrid automata whose arrangements rely consistently upon the underlying state is described. The outcomes on presence, uniqueness, and progression fill in as a beginning stage for solid study. In this paper, we present the structure of hybrid automata as a model and detailed language for hybrid systems. Hybrid automata can be seen as a theory of timed automata, in which the behavior of factors is represented in each state by a bunch of differential conditions. We show that a large number of the models considered in the workshop can be characterized by hybrid automata. While the reachability issue is undecidable in any event, for extremely confined classes of hybrid automata, we present two semi-decision techniques for checking security properties of piecewise-straight hybrid automata, in which all factors change at steady rates. The two techniques are based, individually, on limiting and figuring fix points on for the most part endless state spaces. We show that if the end of the method, at that point they offer the right responses. We then show that for a significant number of the run of the mill workshop models, the strategies do end and hence give an algorithmic approach to confirming their properties.

Sign in / Sign up

Export Citation Format

Share Document