Filters








2,230 Hits in 5.8 sec

Explicitly Parallel Regular Expressions

Brett D. Estrade, A. Louise Perkins, John M. Harris
2006 First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)  
The equivalence of non-deterministic finite automata (NFA 1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented regular expressions (PRE)  ...  deterministic finite automata (DF A min ).  ...  Introduction Investigations and applications of finite state automata (FSA) have traditionally been limited to deterministic and non-deterministic finite automata.  ... 
doi:10.1109/imsccs.2006.60 dblp:conf/imsccs/EstradePH06 fatcat:wpghzilqevebnfjyqxozrxzphi

Automata Describing Object Behavior [article]

Bernhard Rumpe, Cornel Klein
2014 arXiv   pre-print
We will present an automata model together with a denotational and an operational semantics to describe the behavior of objects.  ...  Based on the given semantics we de ne a set of powerful re nement rules and discuss their applicability in software engineering practice especially with the use of inheritance.  ...  In our model, non-deterministic agents are modeled by sets of stream processing functions.  ... 
arXiv:1411.2408v1 fatcat:q7hxytbxcvaibm7wahbfayjfei

Skeleton automata for FPGAs

Jens Teubner, Louis Woods, Chongling Nie
2012 Proceedings of the 2012 international conference on Management of Data - SIGMOD '12  
In this work we report on an FPGA-based stream processing engine that does not have this limitation.  ...  These improvements are made possible by a new design approach for FPGA acceleration, called skeleton automata. Skeleton automata separate the structure of finite-state automata from their semantics.  ...  are ready to use also in combination with the MXQuery engine [10] .  ... 
doi:10.1145/2213836.2213863 dblp:conf/sigmod/TeubnerWN12 fatcat:4fxuqtl7ojfp3ipe7m4ksta6pu

Use of Büchi automata and randomness for the description of biological processes

Konstantinos Giannakis, Theodore Andronikos
2015 International Journal of Scientific World  
Overall, this work contributes by combining for the very first time PBAs with real biological mechanisms, with indicative examples, both with PBAs and NBAs (non-deterministic Büchi automata).  ...  Büchi automata (PBAs), making a novel attempt to establish their use in reasoning about biological processes.  ...  In additions, they proved that probabilistic automata with Büchi acceptance are more expressive than non-deterministic ω-automata.  ... 
doi:10.14419/ijsw.v3i1.4356 fatcat:vhqsjbvl5jawlogy42oky7cxlu

Polychronous Automata

Paul Le Guernic, Thierry Gautier, Jean-Pierre Talpin, Loic Besnard
2015 2015 International Symposium on Theoretical Aspects of Software Engineering  
We propose a model of finite-state automata, called polychronous automata, which is based on clock relations. A specificity of this model is that an automaton is submitted to clock constraints.  ...  Signals are associated with logical clocks, which provide the capability to describe systems in which components obey to multiple clock rates.  ...  Mode-automata have been combined with stream functions in Lucid Synchrone [14] .  ... 
doi:10.1109/tase.2015.21 dblp:conf/tase/GuernicGTB15 fatcat:p2vvncvo4fdlvnk5dk2rmqnkje

Partition and compose

Martin Hirzel
2012 Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems - DEBS '12  
Complex event processing uses patterns to detect composite events in streams of simple events. Typically, the events are logically partitioned by some key.  ...  We have implemented partitioned parallel complex event processing as an extension to IBM's System S highperformance streaming platform.  ...  SASE was a CEP language implemented via NFA b au-tomata (non-deterministic finite automata with buffers) [24, 3] .  ... 
doi:10.1145/2335484.2335506 dblp:conf/debs/Hirzel12 fatcat:fgmph2y6encs7jmjl6odsq43gi

Stochastically Enhanced Timed Automata [chapter]

Lynne Blair, Trevor Jones, Gordon Blair
2000 IFIP Advances in Information and Communication Technology  
There is currently considerable interest in the formal specification of distributed multimedia systems, with the majority of research in this area considering the use of timed formallanguages for the specification  ...  We therefore present stochastically enhanced timed automata, as a solution to the problem.  ...  Stochastic automata are finite state automata extended with clocks.  ... 
doi:10.1007/978-0-387-35520-7_17 fatcat:4f4jyodncnhstc3nc4s5pztodu

Symbolic Register Automata for Complex Event Recognition and Forecasting [article]

Elias Alevizos, Alexander Artikis, Georgios Paliouras
2021 arXiv   pre-print
We also show how the behavior of SRA, as they consume streams of events, can be given a probabilistic description with the help of prediction suffix trees.  ...  We propose an automaton model which is a combination of symbolic and register automata, i.e., we enrich symbolic automata with memory. We call such automata Symbolic Register Automata (SRA).  ...  With non-deterministic SRA each element/event from the string/stream may trigger multiple transitions and thus such a mapping is not possible.  ... 
arXiv:2110.04032v1 fatcat:hxd4dl7wtzbqdb2w5vmmo42xeq

Automata Processor Architecture and Applications: A Survey

Nourah A. Almubarak, Anwar Alshammeri, Imtiaz Ahmad
2016 International Journal of Grid and Distributed Computing  
Non-deterministic Finite Automata (NFAs) running concurrently on the same input stream.  ...  Finite automata-based algorithms are becoming increasingly important for a wide range of application domains to process large volumes of unstructured data.  ...  The other way was to translate the NFA to Deterministic Finite Automata (DFA) because the later requires singularity in a state which allows direct processing O (1) .  ... 
doi:10.14257/ijgdc.2016.9.4.05 fatcat:stay6tyhrzgdhfn4ptnv56oxq4

Light-weight xPath processing of XML stream with deterministic automata

Makoto Onizuka
2003 Proceedings of the twelfth international conference on Information and knowledge management - CIKM '03  
The second, called shared NFA state table, lets the Non-Deterministic Finite Automata (NFA) state set be shared among the DFA states.  ...  This paper proposes four techniques for XPath expression processing based on Deterministic Finite Automata (DFA) for two purposes: to improve the memory usage efficiency of the automata and to support  ...  LazyDFA [9] , and other Non-Deterministic Finite Automata ( NFA ) based algorithms (XFilter [2] , YFilter [7] , and XTrie [4] ) have been proposed as efficient algorithms for processing a large number  ... 
doi:10.1145/956863.956928 dblp:conf/cikm/Onizuka03 fatcat:y2kpt5dchfbszikgwlu5jt4sua

Light-weight xPath processing of XML stream with deterministic automata

Makoto Onizuka
2003 Proceedings of the twelfth international conference on Information and knowledge management - CIKM '03  
The second, called shared NFA state table, lets the Non-Deterministic Finite Automata (NFA) state set be shared among the DFA states.  ...  This paper proposes four techniques for XPath expression processing based on Deterministic Finite Automata (DFA) for two purposes: to improve the memory usage efficiency of the automata and to support  ...  LazyDFA [9] , and other Non-Deterministic Finite Automata ( NFA ) based algorithms (XFilter [2] , YFilter [7] , and XTrie [4] ) have been proposed as efficient algorithms for processing a large number  ... 
doi:10.1145/956927.956928 fatcat:nrnbjvn5cnchndoeo4ujd45jjm

From Synchronous Specifications to Asynchronous Distributed Implementations [chapter]

Peter Scholz
1999 Distributed and Parallel Embedded Systems  
In this contribution, we sketch a design process for reactive systems, specified with the visual formalism Statecharts.  ...  Rammig (ed.), Distributed and Parallel Embedded Systems  ...  This stream semantics is tailored for both the mathematical definition of the behavior of possibly non-deterministic and non-responsive Il-Chart specifications and the formal reasoning about how to get  ... 
doi:10.1007/978-0-387-35570-2_3 fatcat:44v24dtmnvb3hjgjaycwutxch4

Complex event detection at wire speed with FPGAs

Louis Woods, Jens Teubner, Gustavo Alonso
2010 Proceedings of the VLDB Endowment  
Complex event detection is an advanced form of data stream processing where the stream(s) are scrutinized to identify given event patterns.  ...  The challenge for many complex event processing (CEP) systems is to be able to evaluate event patterns on high-volume data streams while adhering to realtime constraints.  ...  Instead, we need to use non-deterministic finite automata (NFA) that guarantee a bound on the space required.  ... 
doi:10.14778/1920841.1920926 fatcat:24rjccjz6jhtzdq2ztayuqxt5u

Detecting and Coordinating Complex Patterns of Distributed Events with KETAL

Luis Daniel Benavides Navarro, Andrés Barrera, Kiyoshige Garcés, Hugo Arboleda
2011 Electronical Notes in Theoretical Computer Science  
Concretely we present the following contributions: i) An analysis of non trivial scenarios found in distributed applications in order to formulate a set of requirements and restrictions for a kernel event-based  ...  The library integrates facilities for explicitly defining complex event patterns, detecting events in distributed systems, and validating sequences of events having into account causal ordering.  ...  JFlap [22] is a package that provides facilities to create deterministic or non-deterministic automata.  ... 
doi:10.1016/j.entcs.2011.11.030 fatcat:ximwdayiw5al5c7sg3pi6w7fdu

Turnstile streaming algorithms might as well be linear sketches

Yi Li, Huy L. Nguyen, David P. Woodruff
2014 Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14  
All known algorithms in this model are linear sketches: they sample a matrix A from a distribution on integer matrices in the preprocessing phase, and maintain the linear sketch A · x while processing  ...  sampling a matrix A from the uniform distribution on O(n log m) integer matrices, with entries of magnitude poly(n), and maintaining the linear sketch Ax.  ...  RANDOMIZED STREAM AUTOMATA In this section, we shall extend the notions and results of deterministic stream automata to randomized stream automata.  ... 
doi:10.1145/2591796.2591812 dblp:conf/stoc/LiNW14 fatcat:rmokgv37ibhhvf7wimdjwme3ee
« Previous Showing results 1 — 15 out of 2,230 results