Finite Completeness of Categories of Petri Nets

Authors:
Marek A. Bednarczyk;Andrzej M. Borzyszkowski;Rafał Somla
Affiliations:
Institute of Computer Science, Gdańsk Branch, Polish Academy of Sciences, Abrahama 18, 81-825 Sopot, Poland. email: {m.bednarczyk,a.borzyszkowski}@ipipan.gda.pl;(Correspd.) Institute of Computer Science, Gdańsk Branch, Polish Academy of Sciences, Abrahama 18, 81-825 Sopot, Poland. email: {m.bednarczyk,a.borzyszkowski}@ipipan.gda.pl;(Correspd.) Institute of Mathematics, Gdańsk University, Wita Stwosza 57, 80-952 Gdańsk, Poland. email: rsomla@univ.gda.pl
Venue:
Fundamenta Informaticae
Year:
2000

Citing 11
Cited 3

Petr nets, algebras, morphisms, and compositionality

Information and Computation
Petri nets are moniods

Information and Computation
Executions: a new partial-order semantics of Petri nets

Theoretical Computer Science
Elementary transition systems

Selected papers of the Second Workshop on Concurrency and compositionality
Models for concurrency

Handbook of logic in computer science (vol. 4)
General Morphisms of Petri Nets (Extended Abstract)

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the Relationship of CCS and Petri Nets

Proceedings of the 11th Colloquium on Automata, Languages and Programming
Decompositions of Asynchronous Systems

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Categories of Models for Concurrency

Seminar on Concurrency, Carnegie-Mellon University
Refinement and Simulation of Nets - A Categorical Characterisation

Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Categories of asynchronous systems

Categories of asynchronous systems

On Preserving Structural and Behavioural Properties by Composing Net Systems on Interfaces

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Limits of Modularity

Fundamenta Informaticae
On a Homomorphism of a Component Petri Net

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 equalizers. 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 multiplicative 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.