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


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

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.

Sobre autores

I. Virbitskaite

A. P. Ershov Institute of Informatics Systems, Siberian Division; Novosibirsk State University

Autor responsável pela correspondência
Email: virb@iis.nsk.su
Rússia, pr. akademika Lavrent’eva 6, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090

V. Borovlev

Novosibirsk State University

Email: virb@iis.nsk.su
Rússia, ul. Pirogova 2, Novosibirsk, 630090

L. Popova-Zeugmann

Humboldt-Universität zu Berlin

Email: virb@iis.nsk.su
Alemanha, Unter den Linden 6, Berlin, 10099

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Ltd., 2016