Sciweavers

FUIN
2007
86views more  FUIN 2007»
13 years 11 months ago
Relative Nondeterministic Information Logic is EXPTIME-complete
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
Stéphane Demri, Ewa Orlowska
CCS
2007
ACM
14 years 5 months ago
Specifying and analyzing security automata using CSP-OZ
Security automata are a variant of B¨uchi automata used to specify security policies that can be enforced by monitoring system execution. In this paper, we propose using CSP-OZ, ...
David A. Basin, Ernst-Rüdiger Olderog, Paul E...