While a typical software component has a clearly specified (static) interface in terms of the
methods and the input/output types they support, information about the correct sequencing …

We present a verification methodology for analysing the decision-making component in
agent-based hybrid systems. Traditionally hybrid automata have been used to both …

Assume-guarantee reasoning enables a “divide-and-conquer” approach to the verification of
large systems that checks system components separately while using assumptions about …

The verification problem for a system consisting of components can be decomposed into
simpler subproblems for the components using assume-guarantee reasoning. However …

Algorithms for learning a minimal separating DFA of two disjoint regular languages have
been proposed and adapted for different applications. One of the most important …

We present Component-Based Simplex Architecture (CBSA), a new framework for assuring
the runtime safety of component-based cyber-physical systems (CPSs). CBSA integrates …

Finite-state verification techniques are often hampered by the state-explosion problem. One
proposed approach for addressing this problem is assume-guarantee reasoning, where a …

We address the issue of efficiently automating assume-guarantee reasoning for simulation
conformance between finite state systems and specifications. We focus on a non-circular …

Techniques for learning automata have been adapted to automatically infer assumptions in
assume-guarantee compositional verification. Learning, in this context, produces …

We propose a purely implicit solution to the contextual assumption generation problem in
assume-guarantee reasoning. Instead of improving the L* algorithm—a learning algorithm …