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: (ed.) Semantics of Programming Languages and Model Theory, Gordon and Breach Science Publ.: Droste, Manfred and Gurevich, Yuri. 1993.

Abstract: We consider the category IP 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. We construct an adjunction between the categories IP and A. This generalizes a recent result of Winskel and Nielsen for condition/event-nets and asynchronous transition systems.

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

Back to the Petri Nets Bibliography