156
click to vote
LATA
2009
Springer
16 years 14 days ago
2009
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 situat...