English
Related papers

Related papers: Performance Evaluation of Components Using a Granu…

200 papers

To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order to take advantage of the strengths of each technique for…

Performance · Computer Science 2010-06-29 Karine Altisen , Yanhong Liu , Matthieu Moy

We propose here a framework to model real-time components consisting of concurrent real-time tasks running on a single processor, using parametric timed automata. Our framework is generic and modular, so as to be easily adapted to different…

Operating Systems · Computer Science 2014-04-02 Youcheng Sun , Giuseppe Lipari , Étienne André , Laurent Fribourg

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á

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

In the recent years it can be observed increasing popularity of parallel processing using multi-core processors, local clusters, GPU and others. Moreover, currently one of the main requirements the IT users is the reduction of maintaining…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-04-05 Łukasz P. Olech , Jan Kwiatkowski

We present time-constrained automata (TCA), a model for hard real-time computation in which agents behaviors are modeled by automata and constrained by time intervals. TCA actions can have multiple start time and deadlines, can be…

Logic in Computer Science · Computer Science 2010-10-28 Matthieu Lemerre , Vincent David , Christophe Aussaguès , Guy Vidal-Naquet

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 (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

Thematic analysis is difficult to scale: manual workflows are labor-intensive, while fully automated pipelines often lack controllability and transparent evaluation. We present \textbf{CentaurTA Studio}, a web-based system for…

Human-Computer Interaction · Computer Science 2026-04-22 Lei Wang , Min Huang , Eduard Dragut

Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show general trends, but a formal tool like reachability analysis can provide guarantees of correctness. Reachability analysis for…

Systems and Control · Electrical Eng. & Systems 2025-05-07 Chelsea Sidrane , Jana Tumova

Quantitative analysis of computing systems is an emerging area in automated formal analysis. Such properties address aspects such as costs and rewards, quality measures, resource consumption, distance metrics, etc. Existing solutions for…

Formal Languages and Automata Theory · Computer Science 2020-10-06 Suguman Bansal

We propose a robust principal component analysis (RPCA) framework to recover low-rank and sparse matrices from temporal observations. We develop an online version of the batch temporal algorithm in order to process larger datasets or…

Machine Learning · Statistics 2022-08-04 Hong-Lan Botterman , Julien Roussel , Thomas Morzadec , Ali Jabbari , Nicolas Brunel

To harness the potential of advanced computing technologies, efficient (real time) analysis of large amounts of data is as essential as are front-line simulations. In order to optimise this process, experts need to be supported by…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-07-03 Jovana Knežević , Ralf-Peter Mundani , Ernst Rank

We consider the setting of component-based design for real-time systems with critical timing constraints. Based on our earlier work, we propose a compositional specification theory for timed automata with I/O distinction, which supports…

Software Engineering · Computer Science 2012-06-21 Chris Chilton , Marta Kwiatkowska , Xu Wang

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

A key challenge in formal verification, particularly in Model Checking, is ensuring the correctness of the verification tools. Erroneous results on complex models can be difficult to detect, yet a high level of confidence in the outcome is…

Formal Languages and Automata Theory · Computer Science 2025-03-07 Andrea Manini , Matteo Rossi , Pierluigi San Pietro

Effective static analyses have been proposed which infer bounds on the number of resolutions or reductions. These have the advantage of being independent from the platform on which the programs are executed and have been shown to be useful…

Programming Languages · Computer Science 2007-05-23 Edison Mera , Pedro Lopez-Garcia , German Puebla , Manuel Carro , Manuel Hermenegildo

Interrupt Timed Automata (ITA) is an expressive timed model, introduced to take into account interruptions, according to levels. Due to this feature, this formalism is incomparable with Timed Automata. However several decidability results…

Logic in Computer Science · Computer Science 2014-09-09 Béatrice Bérard , Serge Haddad , Aleksandra Jovanović , Didier Lime

Parametric analysis is a powerful tool for designing modern embedded systems, because it permits to explore the space of design parameters, and to check the robustness of the system with respect to variations of some uncontrollable…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-02-07 Youcheng Sun , Romain Soulat , Giuseppe Lipari , Étienne André , Laurent Fribourg

In multivariate time series classification, although current sequence analysis models have excellent classification capabilities, they show significant shortcomings when dealing with long sequence multivariate data, such as prolonged…

Machine Learning · Computer Science 2024-10-29 Enshuo Yan , Huachuan Wang , Weihao Xia
‹ Prev 1 2 3 10 Next ›