English
Related papers

Related papers: Random Testing of Model Checkers for Timed Automat…

200 papers

Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whether a TA complies with a system specification. However, the…

Logic in Computer Science · Computer Science 2023-06-22 Jaroslav Bendík , Ahmet Sencan , Ebru Aydin Gol , Ivana Černá

In this paper, we focus on the design and verification of timed automata (TA). We introduce a new method for assisting construction and verification of TA models along with a tool implementing the proposed method, i.e., ATAC: Automated…

Formal Languages and Automata Theory · Computer Science 2020-07-03 Beyazit Yalcinkaya , Ebru Aydin Gol

Timed Automata (TA) are a very popular modeling formalism for systems with time-sensitive properties. A common task is to verify if a network of TA satisfies a given property, usually expressed in Linear Temporal Logic (LTL), or in a subset…

Logic in Computer Science · Computer Science 2021-04-27 Robert L. Smith , Marcello M. Bersani , Matteo Rossi , Pierluigi San Pietro

Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interest is the analysis of their behaviour as time progresses. This modelling formalism is mostly used for checking whether the behaviours of a…

Logic in Computer Science · Computer Science 2019-09-11 Claudio Menghi , Marcello Bersani , Matteo Rossi , Pierluigi San Pietro

Timed automata (TAs) are a widely used formalism to specify systems having temporal requirements. However, exactly specifying the system may be difficult, as the user may not know the exact clock constraints triggering state transitions. In…

Logic in Computer Science · Computer Science 2019-07-05 Étienne André , Paolo Arcaini , Angelo Gargantini , Marco Radavelli

Probabilistic timed automata (PTAs) are timed automata (TAs) extended with discrete probability distributions.They serve as a mathematical model for a wide range of applications that involve both stochastic and timed behaviours. In this…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Hongfei Fu , Yi Li , Jianlin Li , Lijun Zhang

Timed automata (TA) is used for modeling systems with timing aspects. A TA extends a finite automaton with a set of real valued variables called clocks, that measure the time and constraints over the clocks guard the transitions. A…

Formal Languages and Automata Theory · Computer Science 2021-04-20 Ebru Aydin Gol

Machine learning may enable the automated generation of test oracles. We have characterized emerging research in this area through a systematic literature review examining oracle types, researcher goals, the ML techniques applied, how the…

Software Engineering · Computer Science 2021-08-10 Afonso Fontes , Gregory Gay

We propose TOPL automata as a new method for runtime verification of systems with unbounded resource generation. Paradigmatic such systems are object-oriented programs which can dynamically generate an unbounded number of fresh object…

Formal Languages and Automata Theory · Computer Science 2015-01-21 Radu Grigore , Dino Distefano , Rasmus Lerchedahl Petersen , Nikos Tzevelekos

Machine Learning (ML) has become an integral part of our society, commonly used in critical domains such as finance, healthcare, and transportation. Therefore, it is crucial to evaluate not only whether ML models make correct predictions…

Machine Learning · Computer Science 2024-06-11 Steven Cho , Seaton Cousins-Baxter , Stefano Ruberto , Valerio Terragni

Defining test oracles is crucial and central to test development, but manual construction of oracles is expensive. While recent neural-based automated test oracle generation techniques have shown promise, their real-world effectiveness…

Software Engineering · Computer Science 2023-08-29 Soneya Binta Hossain , Antonio Filieri , Matthew B. Dwyer , Sebastian Elbaum , Willem Visser

This paper investigates the decidability of opacity in timed automata (TA), a property that has been proven to be undecidable in general. First, we address a theoretical gap in recent work by J. An et al. (FM 2024) by providing necessary…

Systems and Control · Electrical Eng. & Systems 2025-04-02 Weilin Deng , Daowen Qiu , Jingkai Yang

Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage occurs whenever an attacker successfully deduces confidential internal information. In this work, we…

Cryptography and Security · Computer Science 2022-10-05 Étienne André , Didier Lime , Dylan Marinho , Jun Sun

Machine learning (ML) for text classification has been widely used in various domains. These applications can significantly impact ethics, economics, and human behavior, raising serious concerns about trusting ML decisions. Studies indicate…

Software Engineering · Computer Science 2025-05-27 Lam Nguyen Tung , Steven Cho , Xiaoning Du , Neelofar Neelofar , Valerio Terragni , Stefano Ruberto , Aldeida Aleti

Test-time adaptation (TTA) offers a compelling remedy for machine learning (ML) models that degrade under domain shifts, improving generalisation on-the-fly with only unlabelled samples. This flexibility suits real deployments, yet…

Machine Learning · Computer Science 2026-02-09 Sudarshan Sreeram , Young D. Kwon , Cecilia Mascolo

Encountering shifted data at test time is a ubiquitous challenge when deploying predictive models. Test-time adaptation (TTA) methods address this issue by continuously adapting a deployed model using only unlabeled test data. While TTA can…

Machine Learning · Computer Science 2025-11-11 Mona Schirmer , Metod Jazbec , Christian A. Naesseth , Eric Nalisnick

Model transformations are the cornerstone of Model-Driven Engineering, and provide the essential mechanisms for manipulating and transforming models. Checking whether the output of a model transformation is correct is a manual and…

Software Engineering · Computer Science 2018-05-01 Javier Troya , Sergio Segura , Antonio Ruiz-Cortés

A large number of different model checking approaches has been proposed during the last decade. The different approaches are applicable to different model types including untimed, timed, probabilistic and stochastic models. This paper…

Logic in Computer Science · Computer Science 2007-05-23 Peter Buchholz , Peter Kemper

Probabilistic pushdown automata (pPDA) are a standard operational model for programming languages involving discrete random choices and recursive procedures. Temporal properties are useful for specifying the chronological order of events…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Tobias Winkler , Christina Gehnen , Joost-Pieter Katoen

Testing is widely recognized as an important stage of the software development lifecycle. Effective software testing can provide benefits such as bug finding, preventing regressions, and documentation. In terms of documentation, unit tests…

Software Engineering · Computer Science 2022-04-22 Elizabeth Dinella , Gabriel Ryan , Todd Mytkowicz , Shuvendu K. Lahiri
‹ Prev 1 2 3 10 Next ›