This paper presents the ComBack method for explicit state space exploration. The ComBack method extends the well-known hash compaction method such that full coverage of the state s...
Michael Westergaard, Lars Michael Kristensen, Gert...
Abstract. We study the relationship between name creation and replication in a setting of infinitestate communicating automata. By name creation we mean the capacity of dynamicall...
Workcraft is a framework for the simulation, conversion and analysis of the SDFS models. The plug-in based architecture with embedded scripting language makes the framework an eas...
In this paper we develop a theory for the region-based synthesis of system models given as place/transition-nets with weighted inhibitor arcs (ptinets) from sets of scenarios descr...
Abstract. 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 an...
In this paper we complete the semantical framework proposed in [12] for process and causality semantics of Petri nets by an additional aim and develop process and causality semanti...
Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails. We cons...
Kees M. van Hee, Alexander Serebrenik, Natalia Sid...
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...