For the most recent entries see the Petri Nets Newsletter.

Petri nets and automata with concurrency relations - an adjunction.

Droste, M.; Shortt, R.M.

In: Semantics of Programming Languages and Model Theory, pages 69-87. Gordon and Breach, 1993.

Abstract: The category P of Petri nets with capacities (place/transition nets) and also a category A of automata with a collection of binary concurrency relations indicating when two events, in a particular state of the automaton, commute, are considered in this paper. An adjunction between the categories P and A is constructed. This generalizes a recent result of Winskel and Nielsen for condition/event nets and asynchronous transition systems.

Keywords: Petri nets, category theory, concurrency relation.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography