Model checking is a prominent technique used in the hardware and software industries for
automatic verification. While it is very successful in finding subtle bugs in distributed …

This paper is concerned with construction of some state space abstractions for Time Petri
nets. State class spaces were introduced long ago by Berthomieu and Menasche as finite …

Design of modern digital hardware systems and of complex software systems is almost
always connected with parallelism. For example, execution of an object-oriented p-gram can …

We propose a new, and to date the most general, framework for Petri net unfolding, which
broadens its applicability, makes it easier to use, and increases its efficiency. In particular:(i) …

In this paper, we develop a general technique for truncating Petri net unfoldings,
parameterized according to the level of information about the original unfolding one wants to …

The human society is becoming increasingly dependent on automated control systems, and
the correct behaviour and reliability of the hardware and software used to implement them is …

Abstract Model checking together with other formal methods and techniques is being
adapted for applications to biological systems. We present a selection of approaches used …

To detect problematic circuit behaviour, such as potential hazards and deadlocks, in a
reasonable amount of time a technique is required which would avoid exhaustive …

In this paper, we define branching processes and unfoldings of high-level Petri nets and
propose an algorithm which builds finite and complete prefixes of such unfoldings. The …

We introduce a divide-and-conquer algorithm for a modified version of the reachability/
coverability problem in 1-bounded Petri nets that relies on the compositional algebra of nets …