In this paper, we study the game-theoretic and computational repercussions of Henkin’s partially ordered quantifiers [19]. After defining a gametheoretic semantics for these objects, we observe that tuning the parameter of absentmindedness gives rise to quantifier prefixes studied in [28]. In the interest of computation, we characterize the complexity class PNP q in terms of partially ordered q...

In a computational process, certain entities (for example sets or arrays) and operations on them may be automatically available, for example by being provided by the programming language. We define background classes to formalize this idea, and we study some of their basic properties. The present notion of background class is more general than the one we introduced in an earlier paper, and it t...

This paper advocates the use of self-stabilization as a provable property to achieve the goals of the self-* paradigms for systems, including availability, reliability, serviceability, disaster recovery and autonomic computing. Several recent results starting from hardware concerns, through the operating system, and ending in the applications are integrated: the selfstabilizing microprocessor [...

In not much more than a decade the practice of implementing programs for testing satisfiability of propositional formulas has progressed from being practically a curiosity to an active and competitive endeavor. Impressive performance improvements have made SAT solvers useful in some industrial applications, most notably in formal verification of hardware and software systems as the engine for b...

This paper completes a recent benchmark study in active structural control of a civil engineering structure. The previous work gave an analytical definition of a structure combined with actuators and sensors, along with 15 papers applying various control strategies to this common problem using the same evaluation and performance criteria. As actual implementation is the ultimate test of control...