Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable
Abstract elided by the publisher.
Related papers
- Realizing ømega-regular Hyperproperties CAV 2020
- Deciding Properties of Regular Real Time Processes CAV 1991
- Hierarchical Set Decision Diagrams and Regular Models TACAS 2009
- EREQ: Regular Expressions with Quantifiers and Incremental Quantifier Elimination PLDI 2026
- What is decidable about string constraints with the ReplaceAll function POPL 2018
- Exploring different automata representations for efficient regular expression matching on GPUs PPoPP 2013
- Deciding ω-regular properties on linear recurrence sequences POPL 2021
- Efficient omega-Regular Language Containment CAV 1992