We propose a generalization of results on the decidability of emptiness for several restricted
classes of sequential and distributed automata with auxiliary storage (stacks, queues) that …

The selection of bearing steel surfaces for use with silicon nitride rolling elements within
hybrid bearings is critical to the performance and life of such components, which have …

Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems.
The behaviors are represented as multiply nested words (MNWs), which are words enriched …

We exhibit a methodology to develop mechanically-checkable parameterized proofs of the
correctness of fault-tolerant round-based distributed algorithms in an asynchronous …

We describe a novel technique for bounded analysis of asynchronous message-passing
programs with ordered message queues. Our bounding parameter does not limit the number …

We study the formal language theory of multistack pushdown automata (MPA) restricted to
computations where a symbol can be popped from a stack S only if it was pushed within a …

The reachability analysis of recursive programs that communicate asynchronously over
reliable Fifo channels calls for restrictions to ensure decidability. We extend here a model …

Communicating multi-pushdown systems model networks of multi-threaded recursive
programs communicating via reliable FIFO channels. We extend the notion of split-width [8] …

We study a class of concurrent pushdown systems communicating by both global
synchronisations and reversal-bounded counters, providing a natural model for …

Pattern-based verification checks the correctness of the program executions that follow a
given pattern, a regular expression over the alphabet of program transitions of the form w …