Skip navigation
Skip navigation

Matching trace patterns with regular policies

Baader, Franz; Bauer, Andreas; Tiu, Alwen

Description

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.,

CollectionsANU Research Publications
Date published: 2009
Type: Book chapter
URI: http://hdl.handle.net/1885/57138
DOI: 10.1007/978-3-642-00982-2_9

Download

File Description SizeFormat Image
01_Baader_Matching_trace_patterns_with_2009.pdf185.7 kBAdobe PDF    Request a copy
02_Baader_Matching_trace_patterns_with_2009.pdf82.42 kBAdobe PDF    Request a copy
03_Baader_Matching_trace_patterns_with_2009.pdf140.74 kBAdobe PDF    Request a copy
04_Baader_Matching_trace_patterns_with_2009.pdf20.08 kBAdobe PDF    Request a copy
05_Baader_Matching_trace_patterns_with_2009.pdf91.32 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  27 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator