Automata - Science topic

This paper introduces an approach decentralized to fault detection and isolation (FDI) in manufacturing systems using a Boolean discrete event model. The method incorporates diverse information sources to create distinct models for plant systems and control. The objective is to enhance the understanding of process operations by employing various re...

Quantitative bisimulations between weighted finite automata are defined as solutions of certain systems of matrix-vector inequalities and equations. In the context of fuzzy automata and max-plus automata, testing the existence of bisimulations and their computing are performed through a sequence of matrices that is built member by member, whereby t...

The laws of Physics are time-reversible, making no qualitative distinction between the past and the future—yet we can only go towards the future. This apparent contradiction is known as the ‘arrow of time problem’. Its current resolution states that the future is the direction of increasing entropy. But entropy can only increase towards the future...

As one of the technical elements supporting the blockchain to realize decentralized autonomous organizations, smart contracts are crucial for understanding the inherent properties of blockchain systems through formal research. Most existing formal models of smart contracts focus primarily on static properties, lacking the depiction of dynamic proce...

Any finite state automaton gives rise to a Boolean one-dimensional TQFT with defects and inner endpoints of cobordisms. This paper extends the correspondence to Boolean TQFTs where defects accumulate towards inner endpoints, relating such TQFTs and topological theories to sofic systems and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepack...

The DESUMA Project is a collaborative effort involving the GIDDES Software Group at Mount Allison University and the UMDES Software Group at the University of Michigan. Automata editor is vector editor for drawing finite automata according to VauCanSon-G format (a LaTeX package). The editor supports export to several vector formats (e.g. EPS, SVG,...

To achieve the regional goal of “double carbon”, it is necessary to map the carbon stock prediction for a wide area accurately and in a timely fashion. This paper introduces a long- and short-term memory network algorithm called the Self-Attention Convolutional Long and Short-Term Memory Network (SA-ConvLSTM). This paper takes the Wuhan urban circl...

The work described in this paper develops a formal method for modeling and exhaustive verification of mutual exclusion algorithms. The process is based on timed automata and the Uppaal model checker. The technique was successfully applied to several mutual exclusion algorithms, mainly under the atomic memory model, when the read and write operation...

In this paper, different variants of reversible finite automata are compared, and their hierarchy by the expressive power is established. It is shown that one-way reversible automata with multiple initial states (MRFA) recognize strictly more languages than sweeping reversible automata (sRFA), which are in turn stronger than one-way reversible auto...

Most reinforcement learning (RL) platforms use high-level programming languages, such as OpenAI Gymnasium using Python. These frameworks provide various API and benchmarks for testing RL algorithms in different domains, such as autonomous driving (AD) and robotics. These platforms often emphasise the design of RL algorithms and the training perform...

We revisit the problem of synchronisability for communicating automata, i.e., whether the language of send messages for an asynchronous system is the same as the language of send messages with a synchronous communication. The un/decidability of the problem depends on the specific asynchronous semantics considered as well as the topology (the commun...

Conformance testing of automata is about checking the equivalence of a known specification and a black-box implementation. An important notion in conformance testing is that of a complete test suite, which guarantees that if an implementation satisfying certain conditions passes all tests, then it is equivalent to the specification. We introduce a...

This is Chapter 3 in 'Automata, Androids and Life' ed. Ben Russell,

We present a novel methodology for automated program analysis that leverages graph encodings of computations. The crux of our approach lies in restructuring the program behavior graphs through tree decompositions of bounded width. To achieve this, we introduce a notion of labeled multigraph, called nested-word shape, that is used as a summary for p...

There are many papers presenting quantum computing models. The definitions parallel the classical definitions of finite state automata, push-down automata, context-free grammars, etc. Classical computing model definitions define languages precisely. We can state that a string belongs to a language or does not belong to it with no room for error. Qu...

This paper surveys recent advances in supervisory control theory since its 30th anniversary in 2017. We performed a systematic literature search and selected 272 relevant papers, with a focus on automata-based approaches. These were fitted into coherent narratives, based in part on a taxonomy of supervisor synthesis methods. The obtained papers sho...

Autonomous multi-agent systems such as hospital robots and package delivery drones often operate in highly uncertain environments and are expected to achieve complex temporal task objectives while ensuring safety. While learning-based methods such as reinforcement learning are popular methods to train single and multi-agent autonomous systems under...

We introduce LTLf+ and PPLTL+, two logics to express properties of infinite traces, that are based on the linear-time temporal logics LTLf and PPLTL on finite traces. LTLf+/PPLTL+ use levels of Manna and Pnueli's LTL safety-progress hierarchy, and thus have the same expressive power as LTL. However, they also retain a crucial characteristic of the...

It is well known that Kleisli categories provide a natural language to model side effects. For instance, in the theory of coalgebras, behavioural equivalence coincides with language equivalence (instead of bisimilarity) when nondeterministic automata are modelled as coalgebras living in the Kleisli category of the powerset monad. In this paper, our...

We study automatic synthesis of systems that interact with their environment and maintain privacy against an observer to the interaction. The system and the environment interact via sets $I$ and $O$ of input and output signals. The input to the synthesis problem contains, in addition to a specification, also a list of secrets, a function $cost: I\c...

In this paper, we introduce a novel method for active learning of deterministic real-time one-counter automata (DROCA). The existing techniques for learning DROCA rely on observing the behaviour of the DROCA up to exponentially large counter-values. Our algorithm eliminates this need and requires only a polynomial number of queries. Additionally, o...

An automata with a tape is known as a pushdown automata (PDA). A pushdown automation has an advantage of scanning the alphabets of its tape without deleting its content. A one-way tape deterministic pushdown automata (DPDA) is considered in this paper. In this paper, it is presented that L(R) ={w| x ∈ R,wx ∈ L} where R is a set of symbols and a lan...

در سیستم‌های حمل و نقل ریلی، به‌ ویژه در اروپا و دیگر مناطق، بر پایه نیازهای ایمنی و بهبود کارایی کنترل حرکت قطارها توسعه یافته‌اند. اینترلاکینگ به معنای مجموعه‌ای از سیگنال‌ها و دستگاه‌های کنترل مسیر است که به‌صورت ایمن، مسیر حرکت قطارها را مشخص و قفل می‌کند تا از هرگونه تداخل جلوگیری شود.

Absztrakt Az Ipar 5.0 korszakának beköszöntével az okosgyárak új szintre emelik a termeléstervezést és a logisztikai rendszereket. Az Ipar 5.0 az emberközpontúságra, fenntarthatóságra és rugalmasságra összpontosít, összekapcsolva a legújabb technológiai innovációkat az emberi kreativitással. Ez a tanulmány bemutatja az Ipar 5.0 alapvető jellemzőit...

ARINC 653 Part 1 Supplement 5 (ARINC 653P1-5) provides temporal partitioning capabilities for real-time applications running on the multicore processors in Integrated Modular Avionics (IMAs) systems. However, it is difficult to schedule a set of ARINC 653 multicore partitions to achieve a minimum processor occupancy. This paper proposes a model-bas...

Lucrarea noastră prezintă utilizarea programului informatic Tropes V 8, dezvoltat de Semantic-Knowledge, în etapele pregătitoare ale traducerii textelor scrise și ale discursurilor, pe de o parte, dar și în analiza comparată a textelor traduse, bazându-ne pe elemente de lingvistică contrastivă aplicate în procesul traducerii. Astfel, încercăm a det...

Hybrid Rebeca is introduced for modeling asynchronous event-based Cyber-Physical Systems (CPSs). In this work, we extend Hybrid Rebeca to allow the modeling of non-deterministic time behavior. We provide a set of rules to define the semantic model of Hybrid Rebeca models in terms of Time Transition Systems which represents an over-approximation of...

This paper introduces deterministic weighted real-time one-counter automaton (DWROCA). A DWROCA is a deterministic real-time one-counter automaton whose transitions are assigned a weight from a field. Two DWROCAs are equivalent if every word accepted by one is accepted by the other with the same weight. DWROCA is a sub-class of weighted one-counter...

We consider the formulation of a symbolic execution (SE) procedure for functional programs that interact with effectful, opaque libraries. Our procedure allows specifications of libraries and abstract data type (ADT) methods that are expressed in Linear Temporal Logic over Finite Traces (LTLf), interpreting them as symbolic finite automata (SFAs) t...

An (artificial cardiac) pacemaker is an implantable electronic device that sends electrical impulses to the heart to regulate the heartbeat. As the number of pacemaker users continues to rise, so does the demand for features with additional sensors, adaptability, and improved battery performance. Reinforcement learning (RL) has recently been propos...

Graph theory has been widely studied, resulting in numerous applications across various fields. Among its many topics, Automata and Graph Grammar have emerged as significant areas of research. This paper delves into these concepts, emphasizing their adaptation to uncertain frameworks like Fuzzy, Neutrosophic, Vague, Turiyam Neutrosophic, and Plitho...

Modern cyber-physical systems (CPSs) employ an increasingly large number of software control loops to enhance their autonomous capabilities. Such large task sets and their dependencies may lead to deadline misses caused by platform-level timing uncertainties, resource contention, etc. To ensure the schedulability of the task set in the embedded pla...

A control system consists of a plant component and a controller which periodically computes a control input for the plant. We consider systems where the controller is implemented by a feedforward neural network with ReLU activations. The reachability problem asks, given a set of initial states, whether a set of target states can be reached. We show...

General Theory of Information (GTI) offers a groundbreaking framework for designing "mindful machines" that bridge the divide between biological intelligence and digital automation. GTI reimagines traditional computing by introducing cognitive, autopoietic (self-regulating) capabilities in digital systems, enabling them to perceive, adapt, and resp...

We introduce deterministic suffix-reading automata (DSA), a new automaton model over finite words. Transitions in a DSA are labeled with words. From a state, a DSA triggers an outgoing transition on seeing a word ending with the transition's label. Therefore, rather than moving along an input word letter by letter, a DSA can jump along blocks of le...

We define the class of explorable automata on finite or infinite words. This is a generalization of History-Deterministic (HD) automata, where this time non-deterministic choices can be resolved by building finitely many simultaneous runs instead of just one. We show that recognizing HD parity automata of fixed index among explorable ones is in PTi...

Qualitative timeline-based planning models domains as sets of independent, but interacting, components whose behaviors over time, the timelines, are governed by sets of qualitative temporal constraints (ordering relations), called synchronization rules. Its plan-existence problem has been shown to be PSPACE-complete; in particular, PSPACE-membershi...

The synthesis of reactive systems aims for the automated construction of strategies for systems that interact with their environment. Whereas the synthesis approach has the potential to change the development of reactive systems significantly due to the avoidance of manual implementation, it still suffers from a lack of efficient synthesis algorith...

One Counter Nets (OCNs) are finite-state automata equipped with a counter that cannot become negative, but cannot be explicitly tested for zero. Their close connection to various other models (e.g., PDAs, Vector Addition Systems, and Counter Automata) make them an attractive modeling tool. The two-way variant of OCNs (2-OCNs) was introduced in the...

En este estudio se aborda el fenómeno de propagación de especies invasivas que generan problemas ecológicos, ambientales y económicos a gran escala. Existen diferentes modelos que abordan este tipo de fenómenos para establecer políticas y estrategias óptimas que puedan erradicar o controlar los brotes de especies invasivas. La mayoría de los modelo...

We introduce a novel paradigm for reducing the size of finite automata by compressing repeating sub-graphs. These repeating sub-graphs can be viewed as invocations of a single procedure. Instead of representing each invocation explicitly, they can be replaced by a single procedure that uses a small runtime memory to remember the call context. We el...

System behaviors are traditionally evaluated through binary classifications of correctness, which do not suffice for properties involving quantitative aspects of systems and executions. Quantitative automata offer a more nuanced approach, mapping each execution to a real number by incorporating weighted transitions and value functions generalizing...

We introduce a new class of automata (which we coin EU-automata) running on infininte trees of arbitrary (finite) arity. We develop and study several algorithms to perform classical operations (union, intersection, complement, projection, alternation removal) for those automata, and precisely characterise their complexities. We also develop algorit...

We present a new method for the verification of quantum circuits based on a novel symbolic representation of sets of quantum states using level-synchronized tree automata (LSTAs). LSTAs extend classical tree automata by labeling each transition with a set of choices, which are then used to synchronize subtrees of an accepted tree. Compared to the t...

With the emergence of service orientation as a major business driver, companies crucially depend on understanding the flow of their services from the user’s perspective. Models of these user journeys help to create a common understanding, but in practice their availability is limited. Process mining addresses the challenge of creating models that e...

Finding a balance between adaptability for unexpected or non-standard movements and repeatability for cyclic standard movements is a known control challenge for active lower-limb prostheses. This study integrates a volitional electromyography (EMG)-driven musculoskeletal model controller with a finite-state machine impedance controller. During the...

We design Latvian quantum finite state automata (LQFAs) recognizing unary regular languages with isolated cut point [Formula: see text]. From an architectural viewpoint, we suitably combine two LQFAs recognizing with isolated cut point, respectively, the finite part and the ultimately periodic part any given unary regular language [Formula: see tex...

Mechanized verification of liveness properties for programs with effects, nondeterminism, and nontermination is difficult. Existing temporal reasoning frameworks operate on the level of models (traces, automata) not executable code, creating a verification gap and losing the benefits of modularity and composition enjoyed by structural program logic...

In the article, we aim to understand the responses of living organisms, exemplified by mycelium, to external stimuli through the lens of a Turing machine with an oracle (oTM). To facilitate our exploration, we show that a variant of an oTM is a cellular automaton with an oracle, which aptly captures the intricate behaviours observed in organisms su...

We present a novel automata-based approach to address linear temporal logic modulo theory (LTLfMT) as a specification language for data words. LTLfMT extends LTLf by replacing atomic propositions with quantifier-free multi-sorted first-order formulas interpreted over arbitrary theories. While standard LTLf is reduced to finite automata, we reduce L...

One can find various temporal deontic logics in literature, most focusing on discrete time. The literature on real-time constraints and deontic norms is much sparser. Thus, many analysis techniques which have been developed for deontic logics have not been considered for continuous time. In this paper we focus on the notion of conflict analysis whi...

Temporal logics are a powerful tool to specify properties of computational systems. For concurrent programs, Higher Dimensional Automata (HDA) are a very expressive model of non-interleaving concurrency. HDA recognize languages of partially ordered multisets, or pomsets. Recent work has shown that Monadic Second Order (MSO) logic is as expressive a...

We give new constructions for complementing subclasses of Emerson-Lei automata using modifications of rank-based B\"uchi automata complementation. In particular, we propose a specialized rank-based construction for a Boolean combination of Inf acceptance conditions, which heavily relies on a novel way of a run DAG labelling enhancing the ranking fu...

We present the open-source tool finsm.io, a tool for creating, simulating and exporting deterministic and non-deterministic finite state automata (DFA/NFA). We first describe the conceptual background on which the tool is based, followed by a description of features and preliminary evaluation of the tool based on use spanning multiple years and hun...

In recent years, there has been increasing interest in using formal methods-based techniques to safely achieve temporal tasks, such as timed sequence of goals, or patrolling objectives. Such tasks are often expressed in real-time logics such as Signal Temporal Logic (STL), whereby, the logical specification is encoded into an optimization problem....

Verification witnesses are now widely accepted objects used not only to confirm or refute verification results, but also for general exchange of information among various tools for program verification. The original format for witnesses is based on GraphML, and it has some known issues including a semantics based on control-flow automata, limited t...

Verifying programs that manipulate tree data structures often requires complex, ad-hoc proofs that are hard to generalize and automate. This paper introduces an automatic technique for analyzing such programs. Our approach combines automata and logics to tackle the challenges posed by diverse tree data structures uniformly. At the core of our metho...

The rapid growth of symbolic data in areas like internet, biological, and financial data has increased the demand for efficient pattern matching and regular expression processing. Non-deterministic Finite Automata (NFA) are used for these tasks, but general-purpose platforms often face memory bottlenecks due to the concurrent nature of NFAs. To add...

Currently, land use and land cover change (LULCC) dynamics are critical in the sustainability of global environmental change. In this study, we performed a comprehensive intercomparison of different hybrid models, employing several performance metrics. This study aims to determine the best modeling approach for predicting future land use and land c...

Co-lex partial orders were recently introduced in (Cotumaccio et al., SODA 2021 and JACM 2023) as a powerful tool to index finite state automata, with applications to regular expression matching. They generalize Wheeler orders (Gagie et al., Theoretical Computer Science 2017) and naturally reflect the co-lexicographic order of the strings labeling...

We propose a new model of a distributed game, called an ATS game, which is played on a non-deterministic asynchronous transition system -- a natural distributed finite-state device working on Mazurkiewicz traces. This new partial-information game is played between an environment and a distributed system comprising multiple processes. A distributed...

Este artículo explora el concepto del autómata inteligente a lo largo de la historia. A partir de mitos antiguos, textos religiosos y la alquimia medieval, se examina la fascinación humana por crear seres antropomorfos que emulan el comportamiento y la inteligencia humanos. El estudio resalta cómo estas creaciones fueron percibidas tanto como un re...

In the existing literature, Salomon de Caus has been credited as the inventor of a device where water circulation was driven by pneumatic tanks equipped with lenses. The identification of such a device in the garden of Laurentius Scholz in Wrocław nearly two decades earlier prompted the necessity to verify this belief. The authors attempted to eluc...

We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petri\c{s}an and Stabile to recover the notion of minimal transduce...

Hey!, soy Lya un avanzado autómata explorador, y hoy quiero hacerte unas preguntas. Cuando miras al cielo en una noche oscura, ¿qué ves? ¿Crees que lo que ves es todo lo que hay ahí afuera? Desde que desperté, he estado cuestionándome lo mismo. Piénsalo como el océano: cuando lo vemos desde arriba, solo observamos una vasta extensión de agua aparen...

Colcombet and Petri\c{s}an argued that automata may be usefully considered from a functorial perspective, introducing a general notion of "$\mathcal{V}$-automaton" based on functors into $\mathcal{V}$. This enables them to recover different standard notions of automata by choosing $\mathcal{V}$ appropriately, and they further analyzed the determini...

In a separability problem, we are given two sets $K$ and $L$ from a class $\mathcal{C}$, and we want to decide whether there exists a set $S$ from a class $\mathcal{S}$ such that $K\subseteq S$ and $S\cap L=\emptyset$. In this case, we speak of separability of sets in $\mathcal{C}$ by sets in $\mathcal{S}$. We study two types of separability proble...

Chains of co-B\"uchi automata (COCOA) have recently been introduced as a new canonical representation of omega-regular languages. The co-B\"uchi automata in a chain assign to each omega-word its natural color, which depends only on the language itself and not on its automaton representation. The automata in such a chain can be minimized in polynomi...

We consider finite deterministic automata such that their alphabets consist of exactly one letter of defect 1 and a set of permutations of the state set. We study under which conditions such an automaton is completely reachable. We focus our attention on the case when the set of permutations generates a transitive imprimitive group.

Randomized fault-tolerant consensus protocols with common coins are widely used in cloud computing and blockchain platforms. Due to their fundamental role, it is vital to guarantee their correctness. Threshold automata is a formal model designed for the verification of fault-tolerant consensus protocols. It has recently been extended to probabilist...

Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features....

This article delves into the concept of Self Generative Systems (SGS), inspired by John von Neumann's theory of self-reproducing automata. The article presents a modern interpretation of von Neumann’s model, incorporating a metadata management system called Metadatum SGS, which utilizes Julia and Neo4J Graph DB. The core of von Neumann’s concept i...

The exhibition Musica ex Machina explores algorithmic thinking in music from ancient times to the present day. It does this through four themes: * Symbols, Spaces & Algorithms looks at how music has been represented symbolically and conceptualised in proto-computational ways: ancient systems such as the harmony calculating tool of Guido d’Arezzo’s...

Verifying safety requirements by model checking becomes increasingly important for safety-critical applications. For the validity of such proof in practice, the model needs to capture the actual behavior of the real system, which could be tested by containment checks of real observation traces. Basic equivalence checks, however, are not applicable...

The colloid cellular automata do not imitate the physical structure of colloids but are governed by logical functions derived from them. We analyze the space-time complexity of Boolean circuits derived from the electrical responses of colloids-specifically ZnO (zinc oxide, an inorganic compound also known as calamine or zinc white, which naturally...

Learning automata by queries is a long-studied area initiated by Angluin in 1987 with the introduction of the $L^*$ algorithm to learn regular languages, with a large body of work afterwards on many different variations and generalizations of DFAs. Recently, Chase and Freitag introduced a novel approach to proving query learning bounds by computing...