This is an advanced 2001 textbook on modal logic, a field which caught the attention of
computer scientists in the late 1970s. Researchers in areas ranging from economics to …

The study of graph structure has advanced in recent years with great strides: finite graphs
can be described algebraically, enabling them to be constructed out of more basic elements …

Despite several decades of research, the problem of formal verification of infinite-state
systems has resisted effective automation. We describe a system---Ivy---for interactively …

Runtime monitoring is a general approach to verifying system properties at runtime by
comparing system events against a specification formalizing which event sequences are …

This article focuses on synthesizing control policies for discrete-time stochastic control
systems together with a lower bound on the probability that the systems satisfy the complex …

We present regular model checking, a framework for algorithmic verification of infinite-state
systems with, eg, queues, stacks, integers, or a parameterized linear topology. States are …

Global Constraint Catalogue: Past, Present and Future Page 1 Constraints (2007) 12:21–62 DOI
10.1007/s10601-006-9010-8 Global Constraint Catalogue: Past, Present and Future Nicolas …

LTLf synthesis is the process of finding a strategy that satisfies a linear temporal
specification over finite traces. An existing solution to this problem relies on a reduction to a …

Uncertainty in data naturally arises in various applications, such as data integration and
Web information extraction. Probabilistic XML is one of the concepts that have been …

Abstract We introduce the (0, 1,∞)-counter abstraction method by which a parameterized
system of unbounded size is abstracted into a finite-state system. Assuming that each …