We prove several decidability and undecidability results for ν-PN, an extension of P/T nets
with pure name creation and name management. We give a simple proof of undecidability of …

We study data nets, a generalisation of Petri nets in which tokens carry data from
linearlyordered infinite domains and in which whole-place operations such as resets and …

The execution of different cases of a process is often restricted by inter-case dependencies
through eg, queueing or shared resources. Various high-level Petri net formalisms have …

Abstract Systems with shared resources can be modeled and analyzed using high-level
Petri nets in a natural way. Choosing a model type suitable for the use in conformance …

Mobile computing systems have generated many concerns. Numerous studies have been
performed to model and analyze these systems. This paper focuses on the existing …

We study the relationship between name creation and replication in a setting of infinitestate
communicating automata. By name creation we mean the capacity of dynamically producing …

We study data nets, a generalisation of Petri nets in which tokens carry data from linearly-
ordered infinite domains and in which whole-place operations such as resets and transfers …

Deleting a record from a database table without modifying other records or tables can easily
lead to a violation of the database constraints. The same holds for other database …

When designing complex systems, mechanisms for structuring, composing, and reusing
system components are crucial. Today, there are many approaches for equip** Petri nets …

Data Nets are a version of colored Petri nets in which tokens carry data from an infinite and
linearly ordered domain. This is a very expressive class, though coverability and termination …