In this thesis, we introduce a general method for computing the set of reachable states of an
infinite-state system. The basic idea, inspired by well-known state-space exploration …

We consider the analysis of infinite half-duplex systems made of finite state machines that
communicate over unbounded channels. The half-duplex property for two machines and two …

We address the verification problem of FIFO-channel systems. We apply the symbolic
analysis principle to these systems. We represent their sets of configurations using …

The undecidability of basic decision problems for general FIFO machines such as
reachability and unboundedness is well-known. In this paper, we provide an …

We consider asynchronous networks of finite-state systems communicating via a
combination of reliable and lossy fifo channels. Depending on the topology, the reachability …

Compatibility is a crucial problem that is encountered while constructing new software by
reusing and composing existing components. A set of software components is called …

Formal methods based on symbolic representations have been found to be very effective. In
the case of infinite state systems, there has been a great deal of interest in accelerations—a …

The decidability and complexity of reachability problems and model-checking for flat counter
machines have been explored in detail. However, only few results are known for flat (lossy) …

Choreography specification languages describe from a global point of view interactions
among a set of services in a system to be designed. Given a choreography specification, the …

Model checking is an established technique for automatically verifying that a model satisfies
a given temporal property. When the model violates the property, the model checker returns …