We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving precedence is described. A sound, complete and terminating deterministic constraint solving procedure is given. Deterministic computational model is achieved by weakening the logic such that it is sufficient ...

This paper presents a new approach to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for the precedence are encoded in proposi-tional logic and the resulting formula is tested for satisfiability. Any satisfying assignment represents a weight function and a precedence such that the induced Knuth-Bendix order orients the r...

This note presents an approach to prove termination of term rewrite systems (TRSs) with the Knuth-Bendix order efficiently. The constraints for the weight function as well as for the precedence are encoded in propositional logic and the resulting formula is tested for satisfiability. Any satisfying assignment represents a weight function and a precedence such the induced Knuth-Bendix order orie...

In this paper we consider the labor constrained scheduling problem (LCSP), in which a set of jobs to be processed is subject to precedence and labor requirement constraints. Each job has a speciied processing time and a labor requirements proole, which typically varies as the job is processed. Given the amount of labor available at each period, the problem consists in determining starting times...

In crisis response, hierarchical organizations are being replaced by dynamic assemblies of autonomous agents that promise more agility. However, these autonomous agents might cause a decrease in effectiveness when individually constructed plans for moderately-coupled tasks are not jointly feasible. Existing coordination techniques can be applied in the pre-planning phase to guarantee feasible j...

We consider the problem of determining the optimal sequence of tests for the discovery of a faulty component, where there is a random cost associated with testing a component. Our work is motivated by applications in telecommunications networks, e.g., location and isolation of faults (or intruders) in IP networks. A novel feature in our approach is that a risk-sensitive performance criterion is...

Please cite this article in press as: Y.-S. Chen, M chip, J. Syst. Architect. (2012), http://dx.doi.org/ On-line energy-efficient real-time task scheduling for a heterogeneous dual-core system-on-a-chip is a challenging problem due to precedence constraints and the varied properties of the general-purpose processor core and the synergistic processor core. This study proposes an on-line heteroge...

Real-time systems cover a wide application domain. This paper presents an efficient heuristic algorithm for enforcing the schedulability of aperiodic hard real-time tasks arriving simultaneously with precedence constraints and individual deadlines. The proposed co-synthesis algorithm integrates partitioning and nonpreemptive scheduling. Reconfigurable FPGAs are incrementally added when schedula...

This paper focuses on real-time nonpreemptive multiprocessor scheduling with precedence and strict periodicity constraints. Since this problem is NP-hard, there exist several approaches to resolve it. In addition, because of periodicity constraints our problem stands for a decision problem which consists in determining if, a solution exists or not. Therefore, the first criterion on which the pr...