Conference paperHOLÍK Lukáš, LENGÁL Ondřej, SÍČ Juraj, VEANES Margus and VOJNAR Tomáš. Simulation Algorithms for Symbolic Automata. In: Proc. of 16th International Symposium on Automated Technology for Verification and Analysis. Heidelberg: Springer Verlag, 2018, pp. 109125. ISBN 9783030010898. ISSN 03029743. Available from: http://dx.doi.org/10.1007/9783030010904_7  Publication language:  english 

Original title:  Simulation Algorithms for Symbolic Automata 

Title (cs):  Symbolické algoritmy pro symbolické automaty 

Pages:  109125 

Proceedings:  Proc. of 16th International Symposium on Automated Technology for Verification and Analysis 

Conference:  16th International Symposium on Automated Technology for Verification and Analysis 

Place:  Heidelberg, DE 

Year:  2018 

URL:  http://dx.doi.org/10.1007/9783030010904_7 

ISBN:  9783030010898 

Journal:  Lecture Notes in Computer Science, No. 11138, DE 

ISSN:  03029743 

DOI:  10.1007/9783030010904_7 

Publisher:  Springer Verlag 

Keywords 

symbolic automata simulation finite automata 
Annotation 

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 socalled mintermisation of the transition predicates. This solution, however, generates all Boolean combinations of the predicates, which easily causes an exponential blowup in the number of transitions. Therefore, we propose two more advanced solutions. The first one still applies mintermisation but in a local way, mitigating the size of the exponential blowup. The other one focuses on a novel symbolic way of dealing with transitions, for which we need to sacrifice the counting technique of the original algorithm (counting is used to decrease the dependency of the running time on the number of transitions from quadratic to linear). We perform a thorough experimental evaluation of all the algorithms, together with several further alternatives, showing that all of them have their merits in practice, but with the clear indication that in most of the cases, efficient treatment of symbolic transitions is more beneficial than counting.

BibTeX: 

@INPROCEEDINGS{
author = {Luk{\'{a}}{\v{s}} Hol{\'{i}}k and Ond{\v{r}}ej
Leng{\'{a}}l and Juraj S{\'{i}}{\v{c}} and Margus
Veanes and Tom{\'{a}}{\v{s}} Vojnar},
title = {Simulation Algorithms for Symbolic Automata},
pages = {109125},
booktitle = {Proc. of 16th International Symposium on Automated
Technology for Verification and Analysis},
journal = {Lecture Notes in Computer Science},
number = {11138},
year = {2018},
location = {Heidelberg, DE},
publisher = {Springer Verlag},
ISBN = {9783030010898},
ISSN = {03029743},
doi = {10.1007/9783030010904_7},
language = {english},
url = {http://www.fit.vutbr.cz/research/view_pub.php.en.iso88592?id=11801}
} 
