Sciweavers

1472 search results - page 208 / 295
» On Model Checking Infinite-State Systems
Sort
View
IIWAS
2008
15 years 3 months ago
A model-prover for constrained dynamic conversations
In a service-oriented architecture, systems communicate by exchanging messages. In this work, we propose a formal model based on OCL-constrained UML Class diagrams and a methodolo...
Diletta Cacciagrano, Flavio Corradini, Rosario Cul...
CAISE
2010
Springer
15 years 2 months ago
Beyond Process Mining: From the Past to Present and Future
Abstract. Traditionally, process mining has been used to extract models from event logs and to check or extend existing models. This has shown to be useful for improving processes ...
Wil M. P. van der Aalst, Maja Pesic, Minseok Song
132
Voted
CIKM
2010
Springer
15 years 10 days ago
Rank learning for factoid question answering with linguistic and semantic constraints
This work presents a general rank-learning framework for passage ranking within Question Answering (QA) systems using linguistic and semantic features. The framework enables query...
Matthew W. Bilotti, Jonathan L. Elsas, Jaime G. Ca...
CCGRID
2006
IEEE
15 years 7 months ago
Component-Based Modeling, Analysis and Animation
Component-based software construction is widely used in a variety of applications, from embedded environments to grid computing. However, errors in these applications and systems ...
Jeff Kramer
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
15 years 7 months ago
Dynamic Symmetry Reduction
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
E. Allen Emerson, Thomas Wahl