Matching Trace Patterns with Regular Policies
From MaRDI portal
Publication:3618572
DOI10.1007/978-3-642-00982-2_9zbMath1234.68192OpenAlexW1567267043MaRDI QIDQ3618572
Andreas Bauer, Alwen Tiu, Franz Baader
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_9
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding finite automata within regular expressions
- Automata-theoretic techniques for modal logics of programs
- On the expressive power of temporal logic
- Relationships between nondeterministic and deterministic tape complexities
- Satisfiability of word equations with constants is in NEXPTIME
- The complexity of propositional linear temporal logics
- Monitoring of Real-Time Properties
- Computer Aided Verification
This page was built for publication: Matching Trace Patterns with Regular Policies
