English
Related papers

Related papers: Fault Detection for Timed FSM with Timeouts by Con…

200 papers

There has been a growing interest in defining models of automata enriched with time, such as finite automata extended with clocks (timed automata). In this paper, we study deterministic timed finite state machines (TFSMs), i.e., finite…

Formal Languages and Automata Theory · Computer Science 2021-03-09 Davide Bresolin , Khaled El-Fakih , Tiziano Villa , Nina Yevtushenko

There has been a growing interest in defining models of automata enriched with time. For instance, timed automata were introduced as automata extended with clocks. In this paper, we study models of timed finite state machines (TFSMs), i.e.,…

Formal Languages and Automata Theory · Computer Science 2014-08-27 Davide Bresolin , Khaled El-Fakih , Tiziano Villa , Nina Yevtushenko

Recently there has been a great attention from the scientific community towards the use of the model-checking technique as a tool for test generation in the simulation field. This paper aims to provide a useful mean to get more insights…

Logic in Computer Science · Computer Science 2011-11-14 Margherita Napoli , Mimmo Parente

A fault domain reflects a tester's assumptions about faults that may occur in an implementation and that need to be detected during testing. A fault domain that has been widely studied in the literature on black-box conformance testing is…

Formal Languages and Automata Theory · Computer Science 2025-06-13 Frits Vaandrager , Ivo Melse

The ability to generate test data is often a necessary prerequisite for automated software testing. For the generated data to be fit for its intended purpose, the data usually has to satisfy various logical constraints. When testing is…

Software Engineering · Computer Science 2020-05-19 Ghanem Soltana , Mehrdad Sabetzadeh , Lionel C. Briand

Model-based Testing (MBT) is an effective approach for testing when parts of a system-under-test have the characteristics of a finite state machine (FSM). Despite various strategies in the literature on this topic, little work exists to…

Software Engineering · Computer Science 2022-04-05 Vaclav Rechtberger , Miroslav Bures , Bestoun S. Ahmed , Youcef Belkhier , Jiri Nema , Hynek Schvach

Finite-state models, such as finite-state machines (FSMs), aid software engineering in many ways. They are often used in formal verification and also can serve as visual software models. The latter application is associated with the…

Software Engineering · Computer Science 2016-11-22 Vladimir Ulyantsev , Igor Buzhinsky , Anatoly Shalyto

A well-known testing method for the safety evaluation and real-time validation of automotive software systems (ASSs) is Fault Injection (FI). In accordance with the ISO 26262 standard, the faults are introduced artificially for the purpose…

Software Engineering · Computer Science 2026-03-19 Mohammad Abboush , Ahmad Hatahet , Andreas Rausch

As software systems grow more complex, automated testing has become essential to ensuring reliability and performance. Traditional methods for boundary value test input generation can be time-consuming and may struggle to address all…

Software Engineering · Computer Science 2025-01-27 Xiujing Guo , Chen Li , Tatsuhiro Tsuchiya

The complexity of software in embedded systems has increased significantly over the last years so that software verification now plays an important role in ensuring the overall product quality. In this context, SAT-based bounded model…

Software Engineering · Computer Science 2009-11-20 Lucas Cordeiro , Bernd Fischer , Joao Marques-Silva

Given a deterministic finite automaton and its implementation with at most one single fault, that we can test on a set of inputs, we provide an algorithm to find a test set that guarantees finding whether the fault exists.

Formal Languages and Automata Theory · Computer Science 2021-06-02 Artur Polański , Eryk Lipka

Constructing good test cases is difficult and time-consuming, especially if the system under test is still under development and its exact behavior is not yet fixed. We propose a new approach to compute test strategies for reactive systems…

Software Engineering · Computer Science 2018-09-11 Roderick Bloem , Goerschwin Fey , Fabian Greif , Robert Koenighofer , Ingo Pill , Heinz Riener , Franz Roeck

Writing formal specifications for distributed systems is difficult. Even simple consistency requirements often turn out to be unrealizable because of the complicated information flow in the distributed system: not all information is…

Logic in Computer Science · Computer Science 2017-01-11 Bernd Finkbeiner , Leander Tentrup

The contribution of this paper is threefold: first, it defines a framework for modelling component-based systems, as well as a formalization of integration rules to combine their behavior. This is based on finite state machines (FSM).…

Software Engineering · Computer Science 2014-06-12 Bilal Kanso , Omar Chebaro

The increasing use of model-based tools enables further use of formal verification techniques in the context of distributed real-time systems. To avoid state explosion, it is necessary to construct verification models that focus on the…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-18 Chih-Hong Cheng , Christian Buckl , Javier Esparza , Alois Knoll

Automatic synthesis from temporal logic specifications is an attractive alternative to manual system design, due to its ability to generate correct-by-construction implementations from high-level specifications. Due to the high complexity…

Logic in Computer Science · Computer Science 2023-01-25 Philippe Heim , Rayna Dimitrova

Testing from Input/Output Transition Systems has been intensely investigated. The conformance between the implementation and the specification is often determined by the so-called ioco-relation. However, generating tests for ioco is usually…

Software Engineering · Computer Science 2014-03-31 Adenilso Simao , Alexandre Petrenko

Autonomous critical systems, such as satellites and space rovers, must be able to detect the occurrence of faults in order to ensure correct operation. This task is carried out by Fault Detection and Identification (FDI) components, that…

Logic in Computer Science · Computer Science 2019-03-14 Marco Bozzano , Alessandro Cimatti , Marco Gario , Stefano Tonetta

The language Timed Concurrent Constraint (tccp) is the extension over time of the Concurrent Constraint Programming (cc) paradigm that allows us to specify concurrent systems where timing is critical, for example reactive systems. Systems…

Logic in Computer Science · Computer Science 2007-05-23 Moreno Falaschi , Alicia Villanueva

In this paper, we describe a novel approach for checking safety specifications of a dynamical system with exogenous inputs over infinite time horizon that is guaranteed to terminate in finite time with a conclusive answer. We introduce the…

Optimization and Control · Mathematics 2008-01-04 Amit Bhatia , Emilio Frazzoli
‹ Prev 1 2 3 10 Next ›