Petri nets are a simple formalism for modeling concurrent computation. They are also an interesting tool for modeling and analysing biochemical reaction systems, bridging the gap between purely qualitative and quantit...
详细信息
Petri nets are a simple formalism for modeling concurrent computation. They are also an interesting tool for modeling and analysing biochemical reaction systems, bridging the gap between purely qualitative and quantitative models. Biological networks can indeed be complex, large, and with many unknown kinetic parameters, which makes the development of quantitative models difficult. In this paper, we focus on the Petri net representation of biochemical reactions and on two structural properties of Petri nets, siphons and traps, that bring us information about the persistence of some molecular species, independently of the kinetics. We first study the theoretical time complexity of minimal siphon decision problems in general Petri nets, and present three new complexity results: first, we show that the existence of a siphon of a given cardinality is NP-complete;second, we prove that deciding the Siphon-Trap property is co-NP-complete;third, we prove that deciding the existence of a minimal siphon containing a given set of places, deciding the existence of a siphon of a given cardinality and deciding the Siphon-Trap property can be done in linear time in Petri nets of bounded tree-width. Then, we present a Boolean model of siphons and traps, and two method for enumerating all minimal siphons and traps of a Petri net, by using a SAT solver and a constraintlogic Program (CLP) respectively. On a benchmark of 345 Petri nets of hundreds of places and transitions, extracted from biological models from the BioModels repository, as well as on a benchmark composed of 80 Petri nets from the Petriweb database of industrial processes, we show that both the SAT and CLP methods are overall faster by one or two orders of magnitude compared to the state-of-the-art algorithm from the Petri net community, and are in fact able to solve all the enumeration problems of our practical benchmarks. We investigate why these programs perform so well in practice, and provide some elements of expl
Automatic test case execution in test-driven development provides an excellent return on investment. However, test cases in test-driven development are usually designed manually. Manual acquisition of test cases is la...
详细信息
Automatic test case execution in test-driven development provides an excellent return on investment. However, test cases in test-driven development are usually designed manually. Manual acquisition of test cases is laborious, time-consuming, and error-prone. Model-based testing is a technique to automatically generate test cases from software models. Model-based test-driven development provides an opportunity to automate both test case generation and test case execution. This paper proposes and implements a constraint-based framework for automatic test case generation in method-level black-box unit testing. This framework uniformly solved the test case generation problem using constraintlogic graphs and constraint logic programming. This framework effectively performs equivalence class partitioning and test coverage criteria management on constraintlogic graphs, and simultaneously generates test input and expected output using constraint logic programming. This unifying constraint-based framework can serve as a nucleus for test case generation in model-based unit testing in the future, including method-level black-box, method-level white-box, and class-level unit testing.
As feature models for realistic product families may be quite complicated, automated analysis of feature models is desirable. Although several approaches reported in the literature addressed this issue, complex featur...
详细信息
ISBN:
(纸本)9783642155789
As feature models for realistic product families may be quite complicated, automated analysis of feature models is desirable. Although several approaches reported in the literature addressed this issue, complex feature-attribute and attribute-attribute relationships in extended feature models were not handled effectively. In this article, we introduce a mapping from extended feature models to constraint logic programming over finite domains. This mapping is used to translate basic, cardinality-based, and extended feature models, which may include complex feature-feature, feature-attribute and attribute-attribute cross-tree relationships, into constraintlogic programs. It thus enables use of off-the-shelf constraint solvers for the automated analysis of extended feature models involving such complex relationships. We also briefly discuss the ramifications of including feature-attribute relationships in operations of analysis. We believe that this proposal will be effective for further leveraging of constraint logic programming for automated analysis of feature models.
Policy specification languages such as XACML often provide mechanisms to resolve dynamic conflicts that occur when trying to determine if a request should be permitted or denied access by a policy. Examples include &q...
详细信息
ISBN:
(纸本)9781509009909
Policy specification languages such as XACML often provide mechanisms to resolve dynamic conflicts that occur when trying to determine if a request should be permitted or denied access by a policy. Examples include "deny-overrides" or "first-applicable." Such algorithms are primitive and potentially a risk for corporate computer security. While they can be useful for resolving dynamic conflicts, they are not justified for conflicts that can be easily detected statically. It is better to find those at compile time and remove them before run time. Many different approaches have been used for static conflict detection. However, most of them do not scale well because they rely on pair-wise comparison of the access control logic of policies and rules. We propose an extension of a Prolog-based expert system approach due to Eronen and Zitting. This approach uses constraint logic programming techniques (CLP), which are well-adapted to hierarchical XACML policy logic and avoid pair-wise comparisons altogether by taking advantage of Prolog's built-in powerful indexing system. We demonstrate that expert systems can indeed detect conflicts statically, even those that are generally believed to only be detectable at run time, by inferring the values of attributes that would cause a conflict. As a result, relying on the XACML policy combining algorithms can be avoided in most cases except in federated systems. Finally we provide performance measurements for two different architectures represented in Prolog and give some analysis.
Supply chain problems cover several aspects at different levels and areas. There are decision on production allocation, resource allocation, production and inventory quantities, distributor selection, choice of transp...
详细信息
ISBN:
(纸本)9783319393872;9783319393865
Supply chain problems cover several aspects at different levels and areas. There are decision on production allocation, resource allocation, production and inventory quantities, distributor selection, choice of transportation mode etc. There are many constraints in the supply chain problems. They concern the following areas ( production, distribution, transport, etc.) and types ( linear, non-linear, integer, logical, etc.). Therefore it is important effective modeling and solving constraints. We consider a multi-level and multi-agent approach to modeling and solving supply chain problems using constraint and mathematical programming environments. Its efficiency results from the multi-level presolving and multi-agent architecture. An illustrative example presents effectiveness of the proposed approach. The presented approach will be compared with classical mathematical programming on the same data sets.
This paper addresses the problem of automating the production of test sequences for a particular class of Programmable logic Controllers (em4) produced by InnoVista Sensors (1). The latter are synchronous systems and ...
详细信息
ISBN:
(纸本)9781450341516
This paper addresses the problem of automating the production of test sequences for a particular class of Programmable logic Controllers (em4) produced by InnoVista Sensors (1). The latter are synchronous systems and are programmed by means of an ad hoc integrated development environment (IDE). People using and programming such controllers are not necessarily experienced programmers, so the development of software applications must be simple and intuitive. This should also be the case for testing. Until now, the design of test input sequences is informal and testing is interactively performed by programmers using a simulator included in the IDE. Based on previous investigations on testing of synchronous programs, we propose a method to automatically generate test inputs sequences for synchronous controllers. In a previous paper we presented a new test specification language, called SPTL (Synchronous Programs Testing Language) that makes possible to simply express test scenarios. In this paper, we present a prototype tool that we designed and developed, named "Testium", that translates a SPTL program into a set of constraints exploited by a Prolog solver to randomly choose test inputs.
Multi-echelon distribution systems are quite common in supply-chain and city logistic systems. The paper presents a concept of extending functionality of the multi-distribution models by introduction logical constrain...
详细信息
ISBN:
(纸本)9783319293578;9783319293561
Multi-echelon distribution systems are quite common in supply-chain and city logistic systems. The paper presents a concept of extending functionality of the multi-distribution models by introduction logical constraints. This is possible by using a hybrid approach to modeling and optimization the multi-echelon problems. In the hybrid approach, two environments of mathematical programming (MP) and constraint logic programming (CLP) were integrated. logical constraints are associated with the transformation of the problem made by the CLP. The Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) has been proposed as an illustrative example. The logical constraints on routes, cities etc. were introduced to the standard 2E-CVRP model. The presented approach will be compared with classical mathematical programming on the same data sets (known benchmarks).
This study deals with scheduling groups of jobs, their arrival and delivery, and individual processing of each of them. All jobs in a group should be delivered at the same time after processing. The author presents a ...
详细信息
ISBN:
(纸本)9783319285559;9783319285535
This study deals with scheduling groups of jobs, their arrival and delivery, and individual processing of each of them. All jobs in a group should be delivered at the same time after processing. The author presents a novel way of modeling and decision support-an integrated declarative approach. This approach includes the modeling and solving of the problem in the integrated environment, composed of MP (Mathematical programming) and CLP (constraint logic programming). In addition, the paper proposes the transformation and linearization of the model in CLP/MP environment and implementation framework. Opportunity to ask questions and receive quick answers, taking into account any constraints, conditions and dynamics, constitutes an invaluable support to the manager.
This paper introduces a unified constraint-based test case generator for white-box method-level unit testing. The derivation of a suite of test cases can be defined as a constraint satisfaction problem. Each test case...
详细信息
ISBN:
(纸本)9781509034383
This paper introduces a unified constraint-based test case generator for white-box method-level unit testing. The derivation of a suite of test cases can be defined as a constraint satisfaction problem. Each test case consists of a test input and an expected output. The program is automatically transformed into a constraint model called constraintlogic graph. The constraintlogic graph is a succinct graphical representation of the system of constraints that defines the relationships between the test inputs and actual outputs. The suite of test inputs can be solved from the conjunction of constraints on each complete path of the constraintlogic graph by a constraint logic programming language. The specification of a method is defined by the Object constraint Language. This non-executable specification is automatically transformed into an executable specification defined by a constraint logic programming language. This executable specification serves as the test oracle to automatically generate the corresponding expected output for a given test input.
Understanding tradeoffs among stakeholder requirements regarding liveness (something good happens) and safety (nothing bad happens) is crucial for designing sociotechnical systems (STSs). Safety-focused specifications...
详细信息
ISBN:
(纸本)9781509036943
Understanding tradeoffs among stakeholder requirements regarding liveness (something good happens) and safety (nothing bad happens) is crucial for designing sociotechnical systems (STSs). Safety-focused specifications restrict agents' actions to avoid undesired executions. However, such restrictions hinder liveness. We formalize such tradeoffs using the elements of an STS specification to understand how much a specification promotes liveness or safety. We propose metrics to measure liveness and safety, and demonstrate how constraint logic programming is used to compute such metrics.
暂无评论