Semantic domains of timed event structures

In the paper, timed extensions of various classes of event structures and marked Scott domains are studied, categories of these models are constructed, and their properties are examined. In addition, based on category-theoretic methods, relationship between the timed structures and marked Scott domains is established.     

Analysis of equivalence relations of event structures with continuous time

Notions of testing and bisimulation equivalencies for concurrent nondeterministic processes in real (continuous) time are introduced and analyzed. Processes are represented by timed event structures. Conditions under which the equivalencies defined coincide are established, and algorithms for deciding equivalence are presented.     

Unifying behavioral equivalences of timed transition systems

Timed transition systems are one of the most popular real-time models for concurrency. In the paper, various behavioral equivalences of timed transition systems are defined and studied. In particular, categories of this model are constructed, and their properties are studied. In addition, based on the open maps concept, abstract characterization of the considered equivalences is given. Such an approach makes it possible to develop a metatheory designed for unified definition and study of timed behavioral equivalences in the “linear time-branching time” spectrum of semantics.     

“Truly concurrent” and nondeterministic semantics of discrete-time Petri nets

In the paper, a “truly concurrent” and nondeterministic semantics is defined in terms of branching processes of discrete-time Petri nets (DTPNs). These nets may involve infinite numbers of transitions and places, infinite number of tokens in places, and (maximal) steps of concurrent transitions, which allows us to consider this class of DTPNs to be the most powerful class of Petri nets. It is proved that the unfolding (maximal branching process) of the DTPN is the greatest element of a complete lattice constructed on branching processes of DTPNs with step semantics. Moreover, it is shown that this result is true also in the case of maximal transition steps if additional restrictions are imposed on the structure and behavior of the DTPN.     

Testing Equivalences of Time Petri Nets

Programming and Computer Software - In the paper, we study a family of testing equivalences in interleaving, partial-order semantics, and combined semantics in the context of safe time Petri nets...     

‘True Concurrency’ Semantics for Time Petri Nets with Weak Time and Persistent Atomic Policies

Programming and Computer Software - Dense-Time Petri nets (TPNs), where time intervals for transition firings are assigned, are now a well-established model, which is used to describe and study...