117 search results - page 21 / 24 » On Complexity of Model-Checking for the TQL Logic |
PADS
2009
ACM
14 years 2 months ago
2009
ACM
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
LICS
2000
IEEE
14 years 1 hour ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
CHARME
2005
Springer
14 years 1 months ago
2005
Springer
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...
JSW
2007
13 years 7 months ago
2007
— BPEL (Business Process Execution Language) as a de-facto standard for web service orchestration has drawn particularly attention from researchers and industries. BPEL is a semi...
ICSE
2008
IEEE-ACM
14 years 7 months ago
2008
IEEE-ACM
This paper examines the suitability and use of runtime verification as means for monitoring security protocols and their properties. In particular, we employ the runtime verificat...