A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
نویسندگان
چکیده
In this paper we present a new path order for rewrite systems, the exponential path order EPO ⋆. Suppose a term rewrite system R is compatible with EPO ⋆ , then the runtime complexity of R is bounded from above by an exponential function. Further, the class of function computed by a rewrite system compatible with EPO ⋆ equals the class of functions computable in exponential time on a Turing machine.
منابع مشابه
A Path Order for Rewrite Systems that Compute Exponential Time Functions
In this paper we present a new path order for rewrite systems, the exponential path order EPO. Suppose a term rewrite system is compatible with EPO, then the runtime complexity of this rewrite system is bounded from above by an exponential function. Furthermore, the class of function computed by a rewrite system compatible with EPO equals the class of functions computable in exponential time on...
متن کاملMulti-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)
In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...
متن کاملKripke Models for the Second-Order Lambda-Calculus
We define a new class of Kripke structures for the second-order λ-calculus, and investigate the soundness and completeness of some proof systems for proving inequalities (rewrite rules) or equations. The Kripke structures under consideration are equipped with preorders that correspond to an abstract form of reduction, and they are not necessarily extensional. A novelty of our approach is that w...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملPolynomial Path Orders
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP, that is applicable in two related, but distinct contexts. On the one hand POP induces polynomial innermost runtime complexity and hence may serve as a syntactic, and full...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1010.1128 شماره
صفحات -
تاریخ انتشار 2010