CONTEXT A distributed business process is executed in a distributed computing environment. The service-oriented architecture (SOA) paradigm is a popular option for the integration of software services and execution of distributed business processes. Entailment constraints, such as mutual exclusion and binding constraints, are important means to control process execution. Mutually exclusive task...

Timed pushdown automata (tpda) are an expressive formalism combining recursion with a rich logic of timing constraints. We prove that reachability relations tpda expressible in linear arithmetic, generalising Presburger arithmetic and rational arithmetic. The main technical ingredients novel quantifier elimination result for clock constraints (used to simplify the syntax transitions), use diffe...

the purpose of this research is to study the effects of board of director structure on financing constraints for the companies listed on tehran stock exchange (tse). for this purpose, indigenised kaplan and zingales (kz) index  has been used as a proxy for financing constraints. the population consists of 56 companies of tse spanning 2007-2013 and the multivariate logistic regression is used. t...

Demand Side Management (DSM) is a cost-effective approach to managing electricity networks, aimed at reducing capacity requirements and costs, increasing the penetration of renewable generation, power system emissions. This review article explores distinctive characteristics demand in industrial, commercial, residential sectors, their relationship successful implementation DSM. The constraints ...

This technical report is an extended version of the paper ’A Receding Horizon Algorithm for Informative Path Planning with Temporal Logic Constraints’ accepted to the 2013 IEEE International Conference on Robotics and Automation (ICRA). This paper considers the problem of finding the most informative path for a sensing robot under temporal logic constraints, a richer set of constraints than hav...

The goal of incremental software release planning is to assign planning items to future releases so that value is maximized while various resource, technical and other constraints are satisfied. We propose a new approach to this problem called soft-EVOLVE II, in which a project is first modeled using a highly-general model with a nonlinear objective function, and then a set of high-value releas...

We consider a generalized form of planning, possibly involving loops, that arises in nondeterministic domains when explicit strong fairness constraints are asserted over the planning domain. Such constraints allow us to specify the necessity of occurrence of selected effects of nondeterministic actions over domain’s runs. Also they are particularly meaningful from the technical point of view be...