From Petri nets to automata with concurrency

From MaRDI portal

Publication:1610275

Jump to:navigation, search

DOI10.1023/A:1014305610452zbMath1002.68099MaRDI QIDQ1610275

R. M. Shortt, Manfred Droste

Publication date: 19 August 2002

Published in: Applied Categorical Structures (Search for Journal in Brave)

zbMATH Keywords

Petri net adjunction coreflection automaton with concurrency relations place/transition systems,conditional coproduct

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Related Items (2)

Partial Order Semantics of Types of Nets ⋮ Generating all minimal Petri net unsolvable binary words

This page was built for publication: From Petri nets to automata with concurrency

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1610275&oldid=13911306"