Complete Test Graph Synthesis For Symbolic Real-time Systems
نویسندگان
چکیده
منابع مشابه
Complete test graph generation for symbolic real-time systems∗
We study the generation of test cases for symbolic real-time systems. By symbolic, we mean that the specification of the implementation under test (IUT) is described by using variables and parameters. And by real-time, we mean that the specification of the IUT contains timing constraints. Our method combines and generalizes two test methods presented in previous work, namely : 1) a method for g...
متن کاملSymbolic Model Checking for Real-time Systems
We describe nite-state programs over real-numbered time in a guardedcommand language with real-valued clocks or, equivalently, as nite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time speci cation (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolic...
متن کاملFully symbolic TCTL model checking for complete and incomplete real-time systems
In this paper we introduce a new formal model, called finite state machines with time (FSMT), to represent real-time systems. We present a model checking algorithm for FSMTs, which works on fully symbolic state sets containing both the clock values and the state variables. Besides complete networks of FSMTs our algorithm can verify incomplete real-time systems in form of incomplete FSMTs, and i...
متن کاملSymbolic Schedulability Analysis of Real-Time Systems
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities. We use ACSR-VP to describe an instance of a scheduling problem as a process that has parameters of the problem as free variables. The specification is analyzed by means of a symbolic algorithm. The outcome of the anal...
متن کاملSymbolic Model Checking of Real-Time Systems
We present a new real-time temporal logic for the specification and verification of discrete quantitative temporal properties. This logic is an extension of the well-known logic CTL. Its semantics is defined on discrete time transition systems which are in turn interpreted in an abstract manner instead of the usual stuttering interpretation. Hence, our approach directly supports abstractions of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2005
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2005.03.006