General Morphisms of Petri Nets (Extended Abstract)

Authors:
Marek A. Bednarczyk;Andrzej M. Borzyszkowski
Affiliations:
-;-
Venue:
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Year:
1999

Citing 8
Cited 4

Petr nets, algebras, morphisms, and compositionality

Information and Computation
Mixed product and asynchronous automata

Theoretical Computer Science
Petri nets are moniods

Information and Computation
Elementary transition systems

Selected papers of the Second Workshop on Concurrency and compositionality
Petri nets and automata with concurrency relations—an adjunction

Semantics of programming languages and model theory
Decompositions of Asynchronous Systems

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
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 Concurrent Realization of Reactive Systems and Their Morphisms

Unifying Petri Nets, Advances in Petri Nets
Grammar Morphisms and Weakly Adhesive Categories

ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Limits of Modularity

Fundamenta Informaticae
Finite Completeness of Categories of Petri Nets

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new notion of a general morphism of Petri nets is introduced. The new morphisms are shown to properly include the morphisms considered so far. The resulting category of Petri nets is shown to admit products. Potential applications of general morphisms are indicated.