Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Model Checking for Graded CTL

Ferrante A., Napoli M., Parente M.

Fundamenta Informaticae

2009

Vol. 96, nr 3

323-339

Recently, complexity issues related to the decidability of the μ-calculus, when the universal and existential quantifiers are augmented with graded modalities, have been investigated by Kupfermann, Sattler and Vardi ([19]). Graded modalities refer to the use of the universal and existential quantifiers with the added capability to express the concept of at least k or all but k, for a non-negative integer k. In this paper we study the Computational Tree Logic CTL, a branching time extension of classical modal logic, augmented with graded modalities and investigate the complexity issues with respect to the model-checking problem. We consider a system model represented by a Kripke structure K and give an algorithm to solve the model-checking problem running in time [...] which is hence tight for the problem (here φ is the number of temporal and boolean operators and does not include the values occurring in the graded modalities). In this framework, the graded modalities express the ability to generate a user-defined number of counterexamples to a specification φgiven in CTL. However, these multiple counterexamples can partially overlap, that is they may share some behavior. We have hence investigated the case when all of them are completely disjoint. In this case we prove that the model-checking problem is both NP-hard and coNP-hard and give an algorithm for solving it running in polynomial space. We have thus studied a fragment of graded-CTL, and have proved that the model-checking problem is solvable in polynomial time.

Remarks on the steady-state accuracy of a feedback control system

Ferrante A., Krajewski W., Lepschy A., Viaro U.

Control and Cybernetics

2000

Vol. 29, no 1

51-67

The paper deals with the steady-state response of a feedback control system to the canonical inputs. For its characterization it seems useful to introduce the notion of accuracy index mi beside the standard notion of loop type v. This index is assumed to be equal to the power of t in the analytic expression of the canonical input that leads to a finite nonzero deviation between the actual and the desired responses. When applied in the control design procedure, the accuracy index mi allows to achieve a steady-state performance that is more satisfactory than the one obtainable with reference to the loop type only. The conditions under which a single-loop feedback control system exhibits a prescribed value of mi, given the value of v, are derived and discussed with particular regard to their robustness.