scientific article; zbMATH DE number 554482
From MaRDI portal
Publication:4288284
Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Categories of machines, automata (18B20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited in
(14)- Representation of computations in concurrent automata by dependence orders
- Labelled domains and automata with concurrency
- The synthesis problem for elementary net systems is NP-complete
- From Petri nets to automata with concurrency
- The synthesis of Petri nets from path-automatic specifications
- Trace nets and process automata
- From domains to automata with concurrency
- A Kleene theorem for recognizable languages over concurrency monoids
- Dualities between nets and automata induced by schizophrenic objects
- Polynomial algorithms for the synthesis of bounded nets
- Formal relationships between geometrical and classical models for concurrency
- On the Petri net realization of context-free graphs
- Recognizable languages in concurrency monoids
- Lectures on concurrency and Petri nets. Advances in Petri nets.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288284)
