English
Related papers

Related papers: Parametric non-interference in timed automata

200 papers

We propose two algorithms for discrete-time parameter estimation, one for time-varying parameters under persistent excitation (PE) condition, another for constant parameters under no PE condition. For the first algorithm, we show that in…

Machine Learning · Computer Science 2022-03-15 Yingnan Cui , Joseph E. Gaudio , Anuradha M. Annaswamy

Adversarial attacks in time series classification (TSC) models have recently gained attention due to their potential to compromise model robustness. Imperceptibility is crucial, as adversarial examples detected by the human vision system…

Cryptography and Security · Computer Science 2025-03-26 Wenwei Gu , Renyi Zhong , Jianping Zhang , Michael R. Lyu

This paper proposes an algorithm to maximize reachability probabilities for rectangular automata with random clocks via a history-dependent prophetic scheduler. This model class incorporates time-induced nondeterminism on discrete behavior…

Formal Languages and Automata Theory · Computer Science 2023-05-05 Joanna Delicaris , Stefan Schupp , Erika Ábrahám , Anne Remke

We study the estimation of the ATE in randomized controlled trials under a dynamically evolving interference structure. This setting arises in applications such as ride-sharing, where drivers move over time, and social networks, where…

Statistics Theory · Mathematics 2025-11-11 Su Jia , Peter Frazier , Nathan Kallus , Christina Lee Yu

Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players, Player Min and Player Max, by moving a token along the states of the graph to form an infinite…

Computer Science and Game Theory · Computer Science 2020-01-16 Shibashis Guha , Marcin Jurdzinski , Krishna S. , Ashutosh Trivedi

We present a general non-parametric statistical inference theory for integrals of quantiles without assuming any specific sampling design or dependence structure. Technical considerations are accompanied by examples and discussions,…

Statistics Theory · Mathematics 2026-01-19 Nadezhda Gribkova , Mengqi Wang , Ričardas Zitikis

We extend the definition of a Stochastic Hybrid Automaton (SHA) to overcome limitations that make it difficult to use for on-line control. Since guard sets do not specify the exact event causing a transition, we introduce a clock structure…

Optimization and Control · Mathematics 2012-03-26 Ali Kebarighotbi , Christos G. Cassandras

We consider Pareto analysis of reachable states of multi-priced timed automata (MPTA): timed automata equipped with multiple observers that keep track of costs (to be minimised) and rewards (to be maximised) along a computation. Each…

Logic in Computer Science · Computer Science 2018-05-16 Martin Fränzle , Mahsa Shirmohammadi , Mani Swaminathan , James Worrell

We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability…

Formal Languages and Automata Theory · Computer Science 2014-08-27 Shankara Narayanan Krishna , Lakshmi Manasa , Ashutosh Trivedi

Timeout control is a simple mechanism used when direct feedback is either impossible, unreliable, or too costly, as is often the case in distributed systems. Its effectiveness is determined by a timeout threshold parameter and our goal is…

Optimization and Control · Mathematics 2015-03-20 Ali Kebarighotbi , Christos G. Cassandras

Action anticipation, intent prediction, and proactive behavior are all desirable characteristics for autonomous driving policies in interactive scenarios. Paramount, however, is ensuring safety on the road --- a key challenge in doing so is…

Robotics · Computer Science 2019-01-01 Karen Leung , Edward Schmerling , Mo Chen , John Talbot , J. Christian Gerdes , Marco Pavone

The bandwidth of timed automata characterizes the quantity of information produced/transmitted per time unit. We previously delimited 3 classes of TA according to the nature of their asymptotic bandwidth: meager, normal, and obese. In this…

Formal Languages and Automata Theory · Computer Science 2024-06-24 Eugene Asarin , Aldric Degorre , Catalin Dima , Bernardo Jacobo Inclán

We address the problem of statically checking safety properties (such as assertions or deadlocks) for parameterized phaser programs. Phasers embody a non-trivial and modern synchronization construct used to orchestrate executions of…

Programming Languages · Computer Science 2021-05-13 Zeinab Ganjei , Ahmed Rezine , Ludovic Henrio , Petru Eles , Zebo Peng

Sample average approximation (SAA), a popular method for tractably solving stochastic optimization problems, enjoys strong asymptotic performance guarantees in settings with independent training samples. However, these guarantees are not…

Optimization and Control · Mathematics 2021-12-13 Yafei Wang , Bo Pan , Wei Tu , Peng Liu , Bei Jiang , Chao Gao , Wei Lu , Shangling Jui , Linglong Kong

Parametric timed automata (PTA) extend timed automata with unknown constants ("parameters"), at the price of undecidability of most interesting problems. The (untimed) language preservation problem ("given a parameter valuation, can we find…

Formal Languages and Automata Theory · Computer Science 2018-12-24 Étienne André , Shang-Wei Lin

In this paper we present an information flow security property for stochastic, cooperating, processes expressed as terms of the Performance Evaluation Process Algebra (PEPA). We introduce the notion of Persistent Stochastic Non-Interference…

Performance · Computer Science 2018-08-28 Jane Hillston , Carla Piazza , Sabina Rossi

Parametric estimation for diffusion processes is considered for high frequency observations over a fixed time interval. The processes solve stochastic differential equations with an unknown parameter in the diffusion coefficient. We find…

Methodology · Statistics 2017-04-03 Nina Munkholt Jakobsen , Michael Sørensen

We derive a nonparametric test for constant beta over a fixed time interval from high-frequency observations of a bivariate \Ito semimartingale. Beta is defined as the ratio of the spot continuous covariation between an asset and a risk…

Statistics Theory · Mathematics 2015-02-20 Markus Reiß , Viktor Todorov , George Tauchen

Partial observability and controllability are two well-known issues in test-case synthesis for interactive systems. We address the problem of partial control in the synthesis of test cases from timed-automata specifications. Building on the…

Formal Languages and Automata Theory · Computer Science 2018-05-04 Léo Henry , Thierry Jéron , Nicolas Markey

Simulating hostile attacks of physical autonomous systems can be a useful tool to examine their robustness to attack and inform vulnerability-aware design. In this work, we examine this through the lens of multi-robot patrol, by presenting…

Robotics · Computer Science 2025-09-16 James C. Ward , Alex Bott , Connor York , Edmund R. Hunt
‹ Prev 1 8 9 10 Next ›