Minimization of Visibly Pushdown Automata Using Partial Max-SAT-Reference-Cited by-同舟云学术

Minimization of Visibly Pushdown Automata Using Partial Max-SAT

Published:2017 Issue: Volume: Page:461-478
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Heizmann Matthias,Schilling Christian,Tischner Daniel

Publisher

Springer Berlin Heidelberg

Link

https://link.springer.com/content/pdf/10.1007/978-3-662-54577-5_27

Reference38 articles.

1. Abdulla, P.A., Chen, Y., Holík, L., Vojnar, T.: Mediating for reduction (on minimizing alternating Büchi automata). In: FSTTCS, LIPIcs, vol. 4, pp. 1–12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2009)

2. Abel, A., Reineke, J.: MeMin: SAT-based exact minimization of incompletely specified mealy machines. In: ICCAD, pp. 94–101. IEEE (2015)

3. Lecture Notes in Computer Science;R Almeida,2016

4. Alur, R., Bouajjani, A., Esparza, J.: Model checking procedural programs. In: Handbook of Model Checking. Springer, Heidelberg (2017, to appear)

5. Lecture Notes in Computer Science;R Alur,2005

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Iterative-Epoch Online Cycle Elimination for Context-Free Language Reachability;Proceedings of the ACM on Programming Languages;2024-04-29

2. Recursive State Machine Guided Graph Folding for Context-Free Language Reachability;Proceedings of the ACM on Programming Languages;2023-06-06

3. Taming transitive redundancy for context-free language reachability;Proceedings of the ACM on Programming Languages;2022-10-31

4. Simulation Relations and Applications in Formal Methods;Lecture Notes in Computer Science;2022

5. Learning from survey propagation: a neural network for MAX-E-3-SAT;Machine Learning: Science and Technology;2021-07-14