scientific article; zbMATH DE number 554482

zbMath0795.18003MaRDI QIDQ4288284

R. M. Shortt, Manfred Droste

Publication date: 19 April 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

adjunctionautomata with concurrencycategories of Petri nets

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Related Items (12)

The synthesis of Petri nets from path-automatic specifications ⋮ Labelled domains and automata with concurrency ⋮ Dualities between nets and automata induced by schizophrenic objects ⋮ Trace nets and process automata ⋮ Polynomial algorithms for the synthesis of bounded nets ⋮ The synthesis problem for elementary net systems is NP-complete ⋮ From domains to automata with concurrency ⋮ A kleene theorem for recognizable languages over concurrency monoids ⋮ Recognizable languages in concurrency monoids ⋮ Formal Relationships Between Geometrical and Classical Models for Concurrency ⋮ On the Petri net realization of context-free graphs ⋮ Representation of computations in concurrent automata by dependence orders

This page was built for publication: