Sciweavers

25 search results - page 3 / 5
» Model Checking LTL over Controllable Linear Systems Is Decid...
Sort
View
CDC
2010
IEEE
129views Control Systems» more  CDC 2010»
13 years 23 days ago
A symbolic approach to controlling piecewise affine systems
Abstract-- We present a computational framework for automatic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Te...
Jana Tumova, Boyan Yordanov, Calin Belta, Ivana Ce...
FSTTCS
2009
Springer
14 years 9 days ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau
CSL
2004
Springer
13 years 11 months ago
Parameterized Model Checking of Ring-Based Message Passing Systems
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems,  ¢¡ , comprised of finite, but arbitrarily many,...
E. Allen Emerson, Vineet Kahlon
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
13 years 11 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
ENTCS
2007
113views more  ENTCS 2007»
13 years 5 months ago
On the Decidability of the Safety Problem for Access Control Policies
An access control system regulates the rights of users to gain access to resources in accordance with a specified policy. The rules in this policy may interact in a way that is n...
E. Kleiner, T. Newcomb