Sciweavers

20 search results - page 4 / 4
» fossacs 2007
Sort
View
FOSSACS
2007
Springer
13 years 12 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
FOSSACS
2007
Springer
13 years 12 months ago
On the Expressiveness and Complexity of ATL
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
François Laroussinie, Nicolas Markey, Ghass...
FOSSACS
2007
Springer
13 years 12 months ago
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
Franck van Breugel, Babita Sharma, James Worrell
FOSSACS
2007
Springer
13 years 9 months ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
FOSSACS
2010
Springer
14 years 18 days ago
Retaining the Probabilities in Probabilistic Testing Theory
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...
Sonja Georgievska, Suzana Andova