Sciweavers

201 search results - page 12 / 41
» On the Decidability of Model-Checking for P Systems
Sort
View
ISW
2005
Springer
15 years 5 months ago
Evaluating Access Control Policies Through Model Checking
We present a model-checking algorithm which can be used to evaluate access control policies, and a tool which implements it. The evaluation includes not only assessing whether the ...
Nan Zhang 0003, Mark Ryan, Dimitar P. Guelev
DAGSTUHL
2003
15 years 1 months ago
Deciding Properties of Message Sequence Charts
Message Sequence Charts (MSCs) is a notation used in practice by protocol designers and system engineers. It is defined within an international standard (ITU Z120), and is also i...
Anca Muscholl, Doron Peled
KBSE
2000
IEEE
15 years 4 months ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
LICS
2005
IEEE
15 years 5 months ago
On the Decidability of Metric Temporal Logic
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
Joël Ouaknine, James Worrell
CORR
2007
Springer
135views Education» more  CORR 2007»
14 years 11 months ago
On the decidability and complexity of Metric Temporal Logic over finite words
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
Joël Ouaknine, James Worrell