Timing petri nets categorically

9Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We establish a precise connection between the two distinct ways in which category theory has been applied to the study of Petri Nets. This connection relates morphisms between nets which consider only their static structure to morphisms on their purely dynamic behaviour, and is based on a CCS-like notion of simulation. We apply these results to the timing of Petri Nets.

Cite

CITATION STYLE

APA

Brown, C., & Gurr, D. (1992). Timing petri nets categorically. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 623 LNCS, pp. 571–582). Springer Verlag. https://doi.org/10.1007/3-540-55719-9_105

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free