Matching trace patterns with regular policies
Date
Authors
Baader, Franz
Bauer, Andreas
Tiu, Alwen
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Abstract
We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situations that are problematic, and thus should be avoided. Given a trace pattern u, i.e.,
Description
Citation
Collections
Source
Type
Book Title
Language and Automata Theory and Applications
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description