Robust Satisfaction

@inproceedings{Kupferman1999RobustS,
  title={Robust Satisfaction},
  author={Orna Kupferman and Moshe Y. Vardi},
  booktitle={International Conference on Concurrency Theory},
  year={1999}
}
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general setting, the environment is another open system. Given an open system M and a property ψ, we say that M robustly satisfies ψ iff for every open system M′, which serves as an environment to M, the composition M||M′ satisfies ψ. The problem of robust model checking is then to decide, given M and ψ, whether M robustly… 

Verification of Open Systems

The results show that module checking is computationally harder than model checking, and an algorithmic method that checks whether the open system satisfies the requirement with respect to all environments.

From Model Checking to Model Measuring

It is shown that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved and automata-theoretic model-checking methods are used for model measuring.

An Automata-Theoretic Approach to Infinite-State Systems

An automata-theoretic framework for reasoning about infinite-state sequential systems based on the observation that states of such systems can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata.

Control of nondeterministic discrete-event systems for bisimulation equivalence

This paper obtains a small model theorem showing that a supervisor exists if and only if it exists over a certain finite state space, namely the power set of Cartesian product of system and specification state spaces.

Control of Nondeterministic Discrete Event Systems for Simulation Equivalence

It is shown that existence as well as synthesis of both the target and range control problems remain polynomially solvable and that the simulation relation is a preorder over automata, with the union and the synchronization of the automata serving as an infimal upperbound and a supremal lowerbound, respectively.

Control of nondeterministic discrete event systems for simulation equivalence

The notion of state-controllable-similar is introduced as a necessary and sufficient condition for the existence of similarity enforcing supervisor and polynomial complexity algorithms for testing the existence and synthesis of a supervisor are developed.

An automata-theoretic approach to branching-time model checking

It is shown that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics, and can be used to obtain optimal decision procedures and make it possible to derive optimal model-checking algorithms.

An Automata-Theoretic Approach to Reasoning about Infinite-State Systems

An automata-theoretic framework for reasoning about infinite-state sequential systems based on the observation that states of such systems can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata.

A constraint-based approach to solving games on infinite graphs

A constraint-based approach to computing winning strategies in two-player graph games over the state space of infinite-state programs, which has numerous applications in program verification and synthesis, as well as examples derived from prior work on program repair and synthesis.

References

SHOWING 1-10 OF 46 REFERENCES

Module Checking Revisited

This paper extends the module-checking method with respect to two orthogonal issues, and shows that for universal temporal logics, module checking with incomplete information coincides with module checking, which by itself coincides with model checking.

Module Checking

This paper introduces and examines the problem of model checking of open systems (module checking), and shows that while module checking and model checking coincide for the linear-time paradigm, module checking is much harder than model checking for the branching- time paradigm.

On the Complexity of Branching Modular Model Checking (Extended Abstract)

This paper considers assume-guarantee specifications in which the assumptions and the guarantees are specified by universal branching temporal formulas (i.e., all path quantifiers are universal), and classifies the complexity of satisfiability, validity, implication, and modular model checking for both ∀CTL and ∀ CTL*.

Model checking and modular verification

A framework for compositional verification of finite-state processes based on a subset of the logic CTL for which satisfaction is preserved under composition and a preorder on structures which captures the relation between a component and a system containing the component is described.

An automata-theoretic approach to branching-time model checking

It is shown that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics, and can be used to obtain optimal decision procedures and make it possible to derive optimal model-checking algorithms.

An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)

It is shown that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics, and can be used to obtain optimal decision procedures and make it possible to derive optimal model-checking algorithms.

Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract)

It is found that, with past temporal operators, LTL admits a succinct syntactic formulation of assumption/guarantee specifications, which contrasts, in particular, with the work by Abadi and Lamport using TLA, where working at the syntactic level is more complicated.

Weak alternating automata and tree automata emptiness

A simple algorithm for deciding the nonemptiness of nondeterministic parity and Rabin tree automata is described, which runs in time O(n 2k+1 k!), where n is the number of states in the automaton and k is thenumber of pairs in the acceptance condition.

On the Complexity of Verifying Concurrent Transition Systems

The effect of concurrency on the complexity of implementation verification is investigated, and trace-based and tree-based approaches to the verification of concurrent transition systems, with and without fairness are considered.

"Sometime" is sometimes "not never": on the temporal logic of programs

  • L. Lamport
  • Philosophy, Computer Science
    POPL '80
  • 1980
The logical foundations of the application of temporal logic to concurrent programs are clarified, and the relation between concurrency and nondeterminism is clarified, as well as some problems for further research.