Language inclusion algorithms as complete abstract interpretations

DOI10.1007/978-3-030-32304-2_8zbMATH Open1539.68134MaRDI QIDQ6536285FDOQ6536285

Authors Pierre Ganty, Francesco Ranzato, Pedro Valero

Publication date 19 April 2024

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Complete Abstractions for Checking Language Inclusion
• FORQ-Based Language Inclusion Formal Testing
• Antichains algorithms for the inclusion problem between \(\omega\)-VPL
• Abstraction refinement and antichains for trace inclusion of infinite state systems
• When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)

Cites work

• scientific article; zbMATH DE number 58315 (Why is no real title available?)
• scientific article; zbMATH DE number 1834576 (Why is no real title available?)
• scientific article; zbMATH DE number 3349291 (Why is no real title available?)
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Checking NFA equivalence with bisimulations up to congruence
• Complete abstractions everywhere
• Making abstract interpretations complete
• Nested antichains for WS1S
• On context-free languages and push-down automata
• On regularity of context-free languages
• Petri nets and regular processes
• Sound up-to techniques and complete abstract domains
• Trace inclusion for one-counter nets revisited
• Well quasi-orders and regular languages
• Well-quasi-orders and regular \(\omega\)-languages
• Well-structured transition systems everywhere!

Cited in

(1)

• Antichains algorithms for the inclusion problem between \(\omega\)-VPL

This page was built for publication: Language inclusion algorithms as complete abstract interpretations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536285)