2000 character limit reached
Optimizing an LTS-Simulation Algorithm (Technical Report) (2307.04235v1)
Published 9 Jul 2023 in cs.FL
Abstract: When comparing the fastest algorithm for computing the largest simulation preorder over Kripke structures with the one for labeled transition systems (LTS), there is a noticeable time and space complexity blow-up proportional to the size of the alphabet of an LTS. In this paper, we present optimizations that suppress this increase of complexity and may turn a large alphabet of an LTS to an advantage. Our experimental results show significant speed-ups and memory savings. Moreover, the optimized algorithm allows one to improve asymptotic complexity of procedures for computing simulations over tree automata using recently proposed algorithms based on computing simulation over certain special LTS derived from a tree automaton.
- Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata. In Proc. of TACAS’08, LNCS 4963. Springer, 2008.
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. In Proc. of CIAA’08, LNCS 5148. Springer, 2008.
- Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking. In Proc. of TACAS’05, LNCS 3440. Springer, 2005.
- Abstract Regular Model Checking. In Proc. of CAV’04, LNCS 3114. Springer, 2004.
- Tree Automata Techniques and Applications. http://www.grappa.univ-lille3.fr/tata, 2007. release October, 12th 2007.
- Generation of Reduced Models for Checking Fragments of CTL. In Proc. of CAV’93, 1993.
- O. Grumberg and D. E. Long. Model Checking and Modular Verification. ACM Transactions on Programming Languages and Systems, 16, 1994.
- Computing simulations on finite and infinite graphs. In Proc. of FOCS’95. IEEE Computer Society, 1995.
- L. Holík and J. Šimáček. Optimizing an LTS-Simulation Algorithm. Technical Report FIT-TR-2009-03, Brno University of Technology, 2009. http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2009-03.pdf.
- Optimizing an lts-simulation algorithm. Computing and Informatics, 2010(7):1337–1348, 2010.
- R. Piage and R. Tarjan. Three Partition Refinement Algorithms. SIAM Journal on Computing, 16, 1987.
- F. Ranzato and F. Tapparo. A New Efficient Simulation Equivalence Algorithm. In Proc. of LICS’07, 2007.
- Z. Sawa and P. Jančar. Behavioural Equivalences on Finite-State Systems are PTIME-hard. Computing and Informatics, 24, 2005.