View in EDS

AN EFFICIENT LOTOS-BASED FRAMEWORK FOR DESCRIBING AND SOLVING (TEMPORAL) CSPs.

Saved in:
Bibliographic Details
Title: AN EFFICIENT LOTOS-BASED FRAMEWORK FOR DESCRIBING AND SOLVING (TEMPORAL) CSPs.
Authors: SADAOUI, SAMIRA1 sadaouis@cs.uregina.ca, MOUHOUB, MALEK1 mouhoubm@cs.uregina.ca, CHEN, BO1
Source: International Journal of Software Engineering & Knowledge Engineering. Sep2009, Vol. 19 Issue 6, p765-789. 25p. 19 Diagrams, 2 Charts, 3 Graphs.
Subjects: LOTOS (Computer program language), Programming languages, Computer simulation, Algorithms, Software engineering
Abstract: Simulation of complex Lotos specifications is not always efficient due to the space explosion problem of their corresponding transition systems. To overcome this difficulty in practice, we present in this paper a novel approach which integrates constraint propagation techniques into the Lotos specifications. These solving techniques are used to reduce the size of the search space before and during the search for a solution to a given combinatorial problem under constraints. In order to do that, we first tackle the challenging task of describing combinatorial problems in Lotos using the Constraint Satisfaction Problem (CSP) framework. In this regard, we provide two generic Lotos templates for describing CSPs and temporal CSPs (CSPs involving temporal constraints). To evaluate the time performance of the framework we propose, we have conducted several experimental tests on instances of the N-Queens, the machine scheduling and randomly generated CSPs. The results of these experiments are promising and demonstrate the efficiency of Lotos simulation when CSP techniques are integrated. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Software Engineering & Knowledge Engineering is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Simulation of complex Lotos specifications is not always efficient due to the space explosion problem of their corresponding transition systems. To overcome this difficulty in practice, we present in this paper a novel approach which integrates constraint propagation techniques into the Lotos specifications. These solving techniques are used to reduce the size of the search space before and during the search for a solution to a given combinatorial problem under constraints. In order to do that, we first tackle the challenging task of describing combinatorial problems in Lotos using the Constraint Satisfaction Problem (CSP) framework. In this regard, we provide two generic Lotos templates for describing CSPs and temporal CSPs (CSPs involving temporal constraints). To evaluate the time performance of the framework we propose, we have conducted several experimental tests on instances of the N-Queens, the machine scheduling and randomly generated CSPs. The results of these experiments are promising and demonstrate the efficiency of Lotos simulation when CSP techniques are integrated. [ABSTRACT FROM AUTHOR]
ISSN:02181940
DOI:10.1142/S0218194009004416