Sciweavers

256 search results - page 26 / 52
» Temporal Logics and Model Checking for Fairly Correct System...
Sort
View
CONCUR
2000
Springer
14 years 19 days ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
TACAS
2004
Springer
132views Algorithms» more  TACAS 2004»
14 years 2 months ago
Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study
Numerical analysis based on uniformisation and statistical techniques based on sampling and simulation are two distinct approaches for transient analysis of stochastic systems. We ...
Håkan L. S. Younes, Marta Z. Kwiatkowska, Ge...
DALT
2008
Springer
13 years 10 months ago
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
We propose a variant of alternating time temporal logic (ATL) with imperfect information, perfect recall, epistemic modalities for the past and strategies which are required to be ...
Dimitar P. Guelev, Catalin Dima
FAABS
2004
Springer
14 years 2 months ago
Towards Timed Automata and Multi-agent Systems
Abstract. The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of tempora...
Guillaume Hutzler, Hanna Klaudel, D. Yue Wang
HYBRID
2010
Springer
13 years 11 months ago
Receding horizon control for temporal logic specifications
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
Tichakorn Wongpiromsarn, Ufuk Topcu, Richard M. Mu...