V. A. Borovlev

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1