Sciweavers

1167 search results - page 167 / 234
» A Really Temporal Logic
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
15 years 1 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere
ENTCS
2006
143views more  ENTCS 2006»
15 years 1 months ago
Component-Oriented Specification of Performance Measures
Formal notations for system performance modeling need to be equipped with suitable notations for specifying performance measures. These companion notations have been traditionally...
Alessandro Aldini, Marco Bernardo
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 1 months ago
Alternative axiomatics and complexity of deliberative STIT theories
We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the delib...
Philippe Balbiani, Andreas Herzig, Nicolas Troquar...
JCS
2006
118views more  JCS 2006»
15 years 1 months ago
Language based policy analysis in a SPKI Trust Management System
Abstract-- SPKI/SDSI is a standard for issuing authorization and name certificates. SPKI/SDSI can be used to implement a Trust Management System, where the policy for resource acce...
Arun K. Eamani, A. Prasad Sistla
FUIN
2007
116views more  FUIN 2007»
15 years 1 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek