10,292 research outputs found
A Constrained Object Model for Configuration Based Workflow Composition
Automatic or assisted workflow composition is a field of intense research for
applications to the world wide web or to business process modeling. Workflow
composition is traditionally addressed in various ways, generally via theorem
proving techniques. Recent research observed that building a composite workflow
bears strong relationships with finite model search, and that some workflow
languages can be defined as constrained object metamodels . This lead to
consider the viability of applying configuration techniques to this problem,
which was proven feasible. Constrained based configuration expects a
constrained object model as input. The purpose of this document is to formally
specify the constrained object model involved in ongoing experiments and
research using the Z specification language.Comment: This is an extended version of the article published at BPM'05, Third
International Conference on Business Process Management, Nancy Franc
Early aspects: aspect-oriented requirements engineering and architecture design
This paper reports on the third Early Aspects: Aspect-Oriented Requirements Engineering and Architecture Design Workshop, which has been held in Lancaster, UK, on March 21, 2004. The workshop included a presentation session and working sessions in which the particular topics on early aspects were discussed. The primary goal of the workshop was to focus on challenges to defining methodical software development processes for aspects from early on in the software life cycle and explore the potential of proposed methods and techniques to scale up to industrial applications
Service discovery and negotiation with COWS
To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, deployment and execution. In this paper, we show that constraints and operations on them can be smoothly incorporated in COWS, and propose a disciplined way to model multisets of constraints and to manipulate them through appropriate interaction protocols. Therefore, we demonstrate that also QoS requirement specifications and SLA achievements, and the phases of dynamic service discovery and negotiation can be comfortably modelled in COWS. We illustrate our approach through a scenario for a service-based web hosting provider
Computational tasks in robotics and factory automation
The design of Manufacturing Planning and Control Systems (MPCSs) — systems that negotiate with Customers and Suppliers to exchange products in return for money in order to generate profit, is discussed.\ud
\ud
The computational task of MPCS components are systematically specified as a starting point for the development of computational engines, as computer systems and programs, that execute the specified computation. Key issues are the overwhelming complexity and frequently changing application of MPCSs
Recommended from our members
Constraint-based adaptation for complex space configuration in building services
In this paper an object-based CAD programming is used to take advantage of standardization to handle the schematic design, sizing and layout planning for ceiling mounted fan coil system in a building ceiling void. In order to deal with more complex geometry and real building size, we have used a hybrid approach combining case-based reasoning and constraint programming techniques. Very often, building services engineers use previous solutions and adapt them to new problems. Case-based reasoning mirrors this practical approach and did help us deal effectively with increasingly complex geometry. Our approach combines automation and interactivity. From the specification of the building 3D BIM model, our software prototype proceeds through four steps. First, the user divides the building into zones, each zone being defined by a geometrical primitive (i.e. rectangle zone, triangle zone, curved zone, etc.). Next, for each zone a similar case is retrieved from the case library. The retrieval process will generate a first incomplete 3D solution containing some inconsistencies. Next, the incomplete solution is adapted, using constraint programming techniques, to provide a consistent solution. Finally, distribution routes (i.e. ducts and pipes) are generated using constraint programming techniques. The 3D fan coil solution can be modified or improved by the designer, while providing further contribution by concentrating on interactivity. The project has been funded by the Engineering and Physical Sciences Research Council (EPSRC) in the UK
A taxonomy of asymmetric requirements aspects
The early aspects community has received increasing attention among researchers and practitioners, and has grown a set of meaningful terminology and concepts in recent years, including the notion of requirements aspects. Aspects at the requirements level present stakeholder concerns that crosscut the problem domain, with the potential for a broad impact on questions of scoping, prioritization, and architectural design. Although many existing requirements engineering approaches advocate and advertise an integral support of early aspects analysis, one challenge is that the notion of a requirements aspect is not yet well established to efficaciously serve the community. Instead of defining the term once and for all in a normally arduous and unproductive conceptual unification stage, we present a preliminary taxonomy based on the literature survey to show the different features of an asymmetric requirements aspect. Existing approaches that handle requirements aspects are compared and classified according to the proposed taxonomy. In addition,we study crosscutting security requirements to exemplify the taxonomy's use, substantiate its value, and explore its future directions
Modeling Web Service Selection for Composition as a Distributed Constraint Optimization Problem (DCOP)
During development of a Service-oriented Application, some software pieces could be fulfilled by the connection to Web Services. A list of candidate Web Services could be obtained by making use of any service discovery registry, which are then selected and integrated into the application. However, when it comes to a distributed system, multiple functional and non-functional constraints arise from the interaction between several service requesters and providers, particularly when composing different services. To overcome with such constraints, in this work we propose to model service selection and composition scenarios as Distributed Constraints Optimization Problems (DCOP).We propose different modeling approaches and develop representative examples to be solved through different DCOP algorithms. Also, we analyze the impact of possible extensions to the model in the computability of the problem.Sociedad Argentina de Informática e Investigación Operativa (SADIO
Primitives for Contract-based Synchronization
We investigate how contracts can be used to regulate the interaction between
processes. To do that, we study a variant of the concurrent constraints
calculus presented in [1], featuring primitives for multi-party synchronization
via contracts. We proceed in two directions. First, we exploit our primitives
to model some contract-based interactions. Then, we discuss how several models
for concurrency can be expressed through our primitives. In particular, we
encode the pi-calculus and graph rewriting.Comment: In Proceedings ICE 2010, arXiv:1010.530
- …