Incremental Minimization of Symbolic Automata

2020 ◽  
pp. 54-67
Author(s):  
Jonathan Homburg ◽  
Parasara Sridhar Duggirala
Keyword(s):  
Symbolic Automata ◽  
Incremental Minimization

Abstract Symbolic Automata

2015 ◽  
Vol 50 (1) ◽  
pp. 329-341 ◽  
Author(s):  
Mila Dalla Preda ◽  
Roberto Giacobazzi ◽  
Arun Lakhotia ◽  
Isabella Mastroeni
Keyword(s):  
Symbolic Automata

scholarly journals Wayeb: a Tool for Complex Event Forecasting

10.29007/2s9t ◽  
2018 ◽  
Author(s):  
Elias Alevizos ◽  
Alexander Artikis ◽  
Georgios Paliouras
Keyword(s):  
Markov Chains ◽  
Computational Model ◽  
Real Time ◽  
Complex Event Processing ◽  
Pattern Detection ◽  
Event Processing ◽  
Timely Manner ◽  
Probabilistic Description ◽  
Event Forecasting ◽  
Symbolic Automata

Complex Event Processing (CEP) systems have appeared in abundance during the last two decades. Their purpose is to detect in real–time interesting patterns upon a stream of events and to inform an analyst for the occurrence of such patterns in a timely manner. However, there is a lack of methods for forecasting when a pattern might occur before such an occurrence is actually detected by a CEP engine. We present Wayeb, a tool that attempts to address the issue of Complex Event Forecasting. Wayeb employs symbolic automata as a computational model for pattern detection and Markov chains for deriving a probabilistic description of a symbolic automaton.

scholarly journals Symbolic WS1S

10.29007/t28j ◽  
2018 ◽  
Author(s):  
Loris D'Antoni ◽  
Margus Veanes
Keyword(s):  
Blow Up ◽  
Finite Automata ◽  
Decision Procedures ◽  
Second Order ◽  
Order Logic ◽  
Symbolic Logic ◽  
First Order ◽  
Symbolic Automata ◽  
Second Order Logic ◽  
Monadic Second Order Logic

We extend weak monadic second-order logic of one successor (WS1S) to symbolic alphabets byallowing character predicates to range over decidable first order theories and not just finite alphabets.We call this extension symbolic WS1S (s-WS1S). We then propose two decision procedures for such alogic: 1) we use symbolic automata to extend the classic reduction from WS1S to finite automata toour symbolic logic setting; 2) we show that every s-WS1S formula can be reduced to a WS1S formulathat preserves satisfiability, at the price of an exponential blow-up.

Sign in / Sign up

Export Citation Format

Share Document