This paper describes ESSENTIAL, an efficient deterministic test pattern generation algorit.lim for synchronous sequential circuits. Its concept.ual strat,egy is based upon the combination of reverse time processing over time frames and forward processing wit,hin time frames. In addition to fully exploiting the beneficial methods that have successfully been used for combinational circuits by the...

A new system of generalized mixed implicit equilibrium problems is introduced and studied in real reflexive Banach space. A system of generalized equation problems is considered and its equivalence with the system of generalized mixed implicit equilibrium problems is shown. The iterative algorithm of the solutions is constructed and analyzed through a fixed point formulation of the generalized ...

Explicit, implicit–explicit and Crank–Nicolson implicit–explicit numerical schemes for solving the generalized lubrication equation are derived. We prove that the implicit– explicit and Crank–Nicolson implicit–explicit numerical schemes are unconditionally stable. Numerical solutions obtained from both schemes are compared. Initial curves with both zero and finite contact angles are considered....

In this paper we improve on some results of 3] and extend them to the setting of implicit deenability. We show a strong necessary condition on classes of structures on which PSPACE can be captured by extending PFP with a nite set of generalized quantiiers. For IFP and PTIME the limitation of expressive power of generalized quantiiers is shown only on some speciic nontrivial classes. These resul...

The Kreweras complementation map is an anti-isomorphism on the lattice of noncrossing partitions. We consider an analogous operation for plane trees motivated by the molecular biology problem of RNA folding. In this context, we explicitly count the orbits of Kreweras’ map according to their length as the number of appropriate symmetry classes of trees in the plane. These new enumeration results...

This text gives an overview about my current research in timing analysis at the Vienna University of Technology. After a short introduction to the topic follows the description of an approach relying on CLP, the implicit path enumeration technique (IPET). This technique is also used in a tool developed at the institute of Computer Languages (TuBound). Current timing analysis tools suffer from a...

In 1] a branch-and-bound implicit enumeration algorithm is described to generate a feasible schedule, if any, for each processor on a multiprocessing node running hard real-time processes. The optimization criterion is to minimize process lateness deened as the diierence between the process completion time and deadline. We show in this correspondence that this algorithm does not always succeed ...

Implicit state enumeration for extended finite state machines relies on a decision procedure for Presburger arithmetic. We compare the performance of two Presburger packages, the automata-based Shasta package and the polyhedrabased Omega package. While the raw speed of each of these two packages can be superior to the other by a factor of 50 or more, we found the asymptotic performance of Shast...