Sciweavers

201 search results - page 2 / 41
» On the Decidability of Model-Checking for P Systems
Sort
View
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
JCS
2008
119views more  JCS 2008»
13 years 5 months ago
Synthesising verified access control systems through model checking
We present a framework for evaluating and generating access control policies. The framework contains a modelling formalism called RW, which is supported by a model checking tool. ...
Nan Zhang 0003, Mark Ryan, Dimitar P. Guelev
FSTTCS
2006
Springer
13 years 9 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...
HYBRID
2003
Springer
13 years 11 months ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas
ISW
2004
Springer
13 years 11 months ago
Model-Checking Access Control Policies
We present a model of access control which provides fine-grained data-dependent control, can express permissions about permissions, can express delegation, and can describe syste...
Dimitar P. Guelev, Mark Ryan, Pierre-Yves Schobben...