Filters








2,051 Hits in 5.6 sec

Reducing Timed Automata: A New Approach

Ilham Kitouni
2012 International Journal of Information Sciences and Techniques  
In this paper we present a new approach for reducing timed automata. In fact regions of a region automaton are aggregated according to a coarse equivalence class partitioning based on traces.  ...  KEYWORDS Real time systems, Timed automata, Region automata, model transformation, ATOM3 2 1 0 J J  ...  The idea of region automaton consists of partitioning the states space into finite regions, thus the graph which imitates the behavior of the initial automaton is constructed.  ... 
doi:10.5121/ijist.2012.2402 fatcat:jooahysufrbpdez4ex55rtgm34

Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks [article]

Vlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen Linton
2011 arXiv   pre-print
Finite state automata (FSA) are ubiquitous in computer science.  ...  That computation produced an intermediate DFA with 525,000 states and an unreported number of states for the corresponding minimal DFA.  ...  In the rest of this paper, Section 2 presents related work. Section 3 presents background on finite state automata and their minimization.  ... 
arXiv:1103.5736v1 fatcat:zrx7suswn5fjljwh3kvjdhxpiy

Aggregation-based minimization of finite state automata

Johanna Björklund, Loek Cleophas
2020 Acta Informatica  
We present a minimization algorithm for non-deterministic finite state automata that finds and merges bisimulation-equivalent states.  ...  The bisimulation relation is computed through partition aggregation, in contrast to existing algorithms that use partition refinement.  ...  To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.  ... 
doi:10.1007/s00236-019-00363-5 fatcat:ovsmow44urao7ol2sxesb3oosi

Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata

Markus Lumpe
2010 Electronical Notes in Theoretical Computer Science  
We must, therefore, find some appropriate means to counteract state explosion -one of which is partition refinement through weak bisimulation.  ...  application of the Component Interaction Automata formalism to real-world scenarios.  ...  A hierarchy of component names is defined as follows [5] : • Q is a finite set of states, • Act is a finite set of actions, • δ ⊆ Q × Σ × Q is a finite set of labeled transitions, where Σ ⊆ {(S(H) ∪ {  ... 
doi:10.1016/j.entcs.2010.05.011 fatcat:m3exvbth2fd5xjmc6n4nk3e2fy

Bisimulation relations for weighted automata

Peter Buchholz
2008 Theoretical Computer Science  
This paper introduces a general definition of bisimulation which can be applied to finite automata where weights and labels are assigned to transitions.  ...  Furthermore it is shown that forward and backward bisimulation are congruences according to commonly known composition operations for automata.  ...  We consider weighted automata over finite alphabets and with a finite state space.  ... 
doi:10.1016/j.tcs.2007.11.018 fatcat:kkad6emak5dddfbfieatcqqvke

Automata-based Quantitative Verification [article]

Suguman Bansal
2020 arXiv   pre-print
The introduced framework, called comparator automata or comparators in short, builds on automata-theoretic foundations to generalize across a variety of cost models.  ...  Most algorithms comprise of a structural phase which reasons about the structure of the quantitative system(s) using techniques from automata or graphs, and a numerical phase, which reasons about the quantitative  ...  Only those lassos are accepting for which the loop lies entirely inside one accepting partition of the counterexample automata (recall that states of weak Büchi automata are partitioned, and safety automata  ... 
arXiv:2010.02055v1 fatcat:jynqpn2msrdi5j72t3fm6yuiti

Unexpected Situations Diagnosis: A Model-based Approach for Human Machine Systems

D. Berdjag, F. Vanderhaegen, A. Shumsky, A. Zhirabok
2014 IFAC Proceedings Volumes  
An extension of pair algebra of partitions to nondeterministic finite state machines is used to develop the diagnosis method proposed in the paper.  ...  Possibilities of the proposed method are investigated and discussed. An illustrative example is provided, based on a tramway driving situation.  ...  Secondly, by construction, observation states will inherit most of the remaining determinism and the new partition of the state set obtained through determinization will subsequently impact transitional  ... 
doi:10.3182/20140824-6-za-1003.02674 fatcat:pfuj4nrb2vb5dhcjqtl3bgwzs4

Morphisms and minimization of weighted automata [article]

Sylvain Lombardy
2021 arXiv   pre-print
They correspond respectivly to the classical Moore and Hopcroft algorithms for the computation of the minimal quotient of deterministic Boolean automata.  ...  It starts with the definition of morphisms-which generalises and unifies the notion of bisimulation to the whole class of weighted automata-and the unicity of a minimal quotient for every automaton, obtained  ...  The existence of a minimal deterministic finite automaton, canonically associated with every regular language is one of the basic and fundamental results in the theory of classical finite automata [16  ... 
arXiv:2112.09387v1 fatcat:z67vd64cq5f5fkqnafarzvewj4

Degree of Sequentiality of Weighted Automata [chapter]

Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
2017 Lecture Notes in Computer Science  
We focus on multi-sequential WA that are defined as finite unions of sequential WA. The problem we address is to minimize the size of this union.  ...  property, a pattern on the automaton (a new twinning property) and a subclass of cost register automata.  ...  Introduction Weighted automata. Finite state automata can be viewed as functions from words to Booleans and, thus, describe languages.  ... 
doi:10.1007/978-3-662-54458-7_13 fatcat:io62uuujlbgcpirftv3zhybdfa

Introduction to Active Automata Learning from a Practical Perspective [chapter]

Bernhard Steffen, Falk Howar, Maik Merten
2011 Lecture Notes in Computer Science  
Characteristic for active learning automata learning is its iterative alternation between a "testing" phase for completing the transitions relation of the model aggregated from the observed behavior, and  ...  Central are here advanced techniques for active automata learning [3, 38, 4, 31, 50] , which are designed for optimally aggregating, and where necessary completing, the observed behavior.  ...  Give an example of a learning process in which Algorithm 5 actually leads to an extension of the set of suffixes, and therefore to a refinement of the hypothesis automaton.  ... 
doi:10.1007/978-3-642-21455-4_8 fatcat:g5zdn7okxvgm7fj23avo2mbo6e

Dynamics and Complexity of Computrons

Murat Erkurt
2020 Entropy  
We investigate chaoticity and complexity of a binary general network automata of finite size with external input which we call a computron.  ...  We show that any finite-state machine can be represented as a computron and develop two novel set-theoretic concepts: (i) diversity space as a metric space that captures similarity of configurations on  ...  Conflicts of Interest: The author declares no conflict of interest.  ... 
doi:10.3390/e22020150 pmid:33285925 pmcid:PMC7516563 fatcat:pa4zvesqdne3fh5kfoemrrbzz4

On Computability, Learnability and Extractability of Finite State Machines from Recurrent Neural Networks [article]

Reda Marzouk
2020 arXiv   pre-print
With respect to the former, the long-standing clustering hypothesis of RNN hidden state space when trained to recognize regular languages was explored, and new insights into this hypothesis through the  ...  Examined connections in this master's thesis is threefold: the extractability of finite state machines from recurrent neural networks, learnability aspects and computationnal links.  ...  The idea is to partition the space of finite state automata as: DF A(Σ) = ∞ n=1 DF A n (Σ) and assign a weight to each partition by a weighting function: w : N + → (0, 1) such that n∈N + w(n) ≤ 1.  ... 
arXiv:2009.06398v1 fatcat:qow5uzwcezd7vafuobfocs4dye

Finite automata approximations with error bounds for systems with quantized actuation and measurement: a case study

D.C. Tarraf, A. Megretski, M.A. Dahleh
2004 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)  
We propose an algorithm for generating deterministic finite state machine approximations of these systems with computable bounds on approximation error, and we describe the conditions under which the bounds  ...  We consider stable, discrete time, first order LTI systems with finite input alphabets and quantized outputs.  ...  to automata states.  ... 
doi:10.1109/cdc.2004.1430245 fatcat:hqwddtdgcjdl3ez6fmzc5mopj4

An Overlay Architecture for Pattern Matching

Rasha Karakchi, Charles Daniels, Jason Bakos
2019 2019 IEEE 30th International Conference on Application-specific Systems, Architectures and Processors (ASAP)  
Finite Automata Finite Automata (FA) is a set of states connected by labeled-edges, which are driven by the input sequence, finite automata M as defined by [27] . Definition 1.  ...  ANMLZoo Benchmarks ANMLZoo is a diverse benchmark suite of finite automata for evaluating automata processing engines [11] .  ...  A.2 check_move The check_move A.1 routine evaluates the effect of re-mapping a state in terms of its impact on the mapping score.  ... 
doi:10.1109/asap.2019.000-7 dblp:conf/asap/KarakchiDB19 fatcat:njd5ngymvveivnjqefc5vok5du

Simulation Algorithms for Symbolic Automata (Technical Report) [article]

Lukáš Holík, Ondřej Lengál, Juraj Síč, Margus Veanes, Tomáš Vojnar
2018 arXiv   pre-print
We investigate means of efficient computation of the simulation relation over symbolic finite automata (SFAs), i.e., finite automata with transitions labeled by predicates over alphabet symbols.  ...  In one approach, we build on the algorithm by Ilie, Navaro, and Yu proposed originally for classical finite automata, modifying it using the so-called mintermisation of the transition predicates.  ...  Introduction We investigate algorithms for computing simulation relations on states of symbolic finite automata.  ... 
arXiv:1807.08487v2 fatcat:gdprvbc5szgvzn3pcnjhqi6n4a
« Previous Showing results 1 — 15 out of 2,051 results