20 search results - page 4 / 4 » Model Checking with Finite Complete Prefixes Is PSPACE-Compl... |
174
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
152
click to vote
ASM
2008
ASM
15 years 7 months ago
2008
ASM
This paper describes the formal modeling and analysis of a design for a flash-based filesystem in Alloy. We model the basic operations of a filesystem as well as features that are ...
184
Voted
UML
2005
Springer
15 years 11 months ago
2005
Springer
We present in this paper a rigorous and automated based approach for the behavioral validation of control software systems. This approach relies on metamodeling, model-transformati...
163
Voted
EDCC
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In this paper we present a new modelling approach for dependability evaluation and sensitivity analysis of Scheduled Maintenance Systems, based on a Deterministic and Sto...
185
Voted
WWW
2004
ACM
16 years 6 months ago
2004
ACM
This paper presents a set of tools and techniques for analyzing interactions of composite web services which are specified in BPEL and communicate through asynchronous XML message...