Embedding finite automata within regular expressions

DOI10.1016/j.tcs.2008.03.011zbMath1223.68063OpenAlexW2089939112MaRDI QIDQ947783

Sitvanit Ruah, Shoham Ben-David, Dana Fisman

Publication date: 7 October 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.011

zbMATH Keywords

embeddingmodel checkingfinite automataregular expressionPSLlinear translationon-the-fly

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Functional Specification of Hardware via Temporal Logic ⋮ Embedding finite automata within regular expressions ⋮ Vacuity in practice: temporal antecedent failure ⋮ Matching Trace Patterns with Regular Policies

Uses Software

• FoCs

Cites Work

• Rewriting extended regular expressions
• Embedding finite automata within regular expressions
• The temporal semantics of concurrent programs
• Quantified computation tree logic
• On the power of bounded concurrency I
• Hardware and Software, Verification and Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item