Timed automaton
View article: Transfer of Temporal Logic Formulas in Reinforcement Learning
Transfer of Temporal Logic Formulas in Reinforcement Learning Open
Transferring high-level knowledge from a source task to a target task is an effective way to expedite reinforcement learning (RL). For example, propositional logic and first-order logic have been used as representations of such knowledge. …
View article
STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS Open
This paper introduces semi‐tensor product of matrices (STP), a new matrix analysis tool, into the field of discrete event dynamic system (DEDS). Using STP, the dynamics of controlled automaton are modelled as an algebraic expression of the…
View article
The Černý Conjecture and 1-Contracting Automata Open
A deterministic finite automaton is synchronizing if there exists a word that sends all states of the automaton to the same state. Černý conjectured in 1964 that a synchronizing automaton with $n$ states has a synchronizing word of length …
View article
Experimental demonstration of quantum finite automaton Open
In quantum information science, a major task is to find the quantum models that can outperform their classical counterparts. Automaton is a fundamental computing model that has wide applications in many fields. It has been shown that the q…
View article
On cellular automata, traffic and dynamical systems in graphs Open
Qualitative studies of discrete dynamical systems behavior on networks are relevant in many fields such as system biology, transportation, information traffic, material sciences and so on. We consider cellular automata on one-dimensional a…
View article
On Decision Problems for Timed Automata Open
We solve some decision problems for timed automata which were raised by Tripakis in [9] and by Asarin in [3]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a ti…
View article
Control of Black-Box Embedded Systems by Integrating Automaton Learning and Supervisory Control Theory of Discrete-Event Systems Open
The paper presents an approach to the control of black-box embedded systems by integrating automaton learning and supervisory control theory (SCT) of discrete-event systems (DES), where automaton models of both the system and requirements …
View article
Dynamic Timed Automata for Reconfigurable System Modeling and Verification Open
Modern discrete-event systems (DESs) are often characterized by their dynamic structures enabling highly flexible behaviors that can respond in real time to volatile environments. On the other hand, timed automata (TA) are powerful tools u…
View article
Semicomputable Points in Euclidean Spaces Open
We introduce the notion of a semicomputable point in R^n, defined as a point having left-c.e. projections. We study the range of such a point, which is the set of directions on which its projections are left-c.e., and is a convex cone. We …
View article
MCMT in the Land of Parametrized Timed Automata Open
Timed networks are parametrized systems of timed au\-to\-ma\-ta. Solving reachability problems (e.g., whether a set of unsafe states can ever be reached from the set of initial states) for this class of systems allows one to prove safety p…
View article
Development of vehicle speed forecasting method for intelligent highway transport system Open
Interaction of vehicles on an intercity highway is considered. The vehicle control model here is idealized, close to the 4th generation automated intelligent transport system. Each vehicle has the desired motion program, independent of the…
View article
Why Liveness for Timed Automata Is Hard, and What We Can Do About It Open
The reachability problem for timed automata asks if a given automaton has a run leading to an accepting state, and the liveness problem asks if the automaton has an infinite run that visits accepting states infinitely often. Both of these …
View article
Reachability in Networks of Register Protocols under Stochastic Schedulers Open
We study the almost-sure reachability problem in a distributed system obtained as the asynchronous composition of N copies (called processes) of the same automaton (called protocol), that can communicate via a shared register with finite d…
View article
Clock Bound Repair for Timed Systems Open
We present algorithms and techniques for the repair of timed system models, given as networks of timed automata (NTA). The repair is based on an analysis of timed diagnostic traces (TDTs) that are computed by real-time model checking tools…
View article
Verification of Two Real-Time Systems Using Parametric Timed Automata Open
—In this paper we propose solutions to the FMTV challenge of a distributed video processing system using the formalism of Parametric Timed Automata (PTA). The first challenge is harder because of the very large number of states to be analy…
View article
Reachability in pushdown register automata Open
We investigate reachability in pushdown automata over infinite alphabets. We show that, in terms of reachability/emptiness,
\nthese machines can be faithfully represented using only 3r elements of the alphabet, where r is the number of reg…
View article
Ultrametric automata and Turing machines Open
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but compl…
View article
Fast Algorithms for Handling Diagonal Constraints in Timed Automata Open
International audience
View article
Finite Response and Confluence of State-based Supervisory Controllers Open
The development of logic controllers for cyber-physical systems is a difficult and error-prone process. Supervisor synthesis can ease the development process, by synthesizing a correct-by-construction supervisor from a model of the plant a…
View article
Modelling and temporal evaluation of networked control systems using timed automata with guards and (max,+) algebra Open
In this paper, we have proposed a new approach to evaluate the response time of Networked Control Systems (NCS) working under client/server protocol. For this, we have used two tools of discrete event systems: Timed Automata with Guards (T…
View article
Non-blocking Supervisory Control of Timed Automata using Forcible Events Open
Real-valued clocks make the state space of timed automata (TA) infinite. Conventional supervisory control synthesis techniques are only applicable to finite automata (FA). Therefore, to synthesize a supervisor for TA using conventional tec…
View article
Reachability in Parameterized Systems: All Flavors of Threshold Automata Open
Threshold automata, and the counter systems they define, were introduced as a framework for parameterized model checking of fault-tolerant distributed algorithms. This application domain suggested natural constraints on the automata struct…
View article
Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata Open
We study semi-algorithms to synthesise the constraints under which a Parametric Timed Automaton satisfies some liveness requirement. The algorithms traverse a possibly infinite parametric zone graph, searching for accepting cycles. We prov…
View article
Latency Evaluation of SDFGs on Heterogeneous Processors Using Timed Automata Open
Synchronous Data Flow (SDF) is a graphical computation model used for analyzing digital signal processing and real time multimedia applications. In general, these applications have two primary performance metrics - throughput and latency. …
View article
Hybrid Automata for Formal Modeling and Verification of Cyber-Physical Systems Open
The presence of a tight integration between the discrete control (the "cyber") and the analog environment (the "physical")---via sensors and actuators over wired or wireless communication networks---is the defining feature of cyber-physica…
View article
The MIRELA framework: modeling and analyzing mixed reality applications using timed automata Open
Mixed Reality (MR) aims to link virtual entities with the real world and has many applications such as military and medical domains [JBL+00, NFB07]. In many MR systems and more precisely in augmented scenes, one needs the application to re…
View article
Reversibility of d-State Finite Cellular Automata Open
This paper investigates reversibility properties of 1-dimensional 3-neighborhood d-state finite cellular automata (CAs) of length n under periodic boundary condition. A tool named reachability tree has been developed from de Bruijn graph w…
View article
A novel cryptosystem based on abstract automata and Latin cubes Open
In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on…
View article
Formal Modeling and Verification of Embedded Real-Time Systems: An Approach and Practical Tool Based on Constraint Time Petri Nets Open
Modeling and verification of the correct behavior of embedded real-time systems with strict timing constraints is a well-known and important problem. Failing to fulfill a deadline in system operation can have severe consequences in the pra…
View article
Minimal Determinization Algorithm for Fuzzy Automata Open
The determinization of fuzzy automata is a well-studied problem in theoretical computer science celebrated for its practical applications. Indeed, in the fields of fuzzy discrete event systems, fault diagnosis, clinical monitoring, decisio…