Finite completeness of categories of Petri nets

• Autorzy: Bednarczyk M.A. , Borzyszkowski A.M. , Somla R.
• Języki publikacji: EN

Abstrakty

EN

The problem of finite completeness of categories of Petri nets is studied. Since Petri nets have finite products, the problem reduces to the issue of the existence of equaliz-ers. We show that the categories of Petri nets with general and Winskel morphisms do not admit equalizers, and hence are not finitely complete. The main positive result of the paper states that reachable Petri nets with multiplica-tive morphisms form a finitely complete category. As an application of this result, some well-known categories are shown to be finitely complete. For instance, since all morphisms between reachable safe Petri nets are multiplicative, it follows that the category of reachable safe Petri nets is finitely complete.

Słowa kluczowe

EN

categories of Petri nets; products; equalizers; finite completeness

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2000
• Tom: Vol. 43, Nr 1-4
• Strony: 21--48
• Opis fizyczny: bibliogr. 15 poz.

Twórcy

autor

Bednarczyk M.A.

autor

Borzyszkowski A.M.

autor

Somla R.

• Institute of Computer Science, Gdańsk Brach, Polish Academy of Sciences, Abrahama 18, 81-825 Sopot, Poland,