scientific article; zbMATH DE number 6790170

DOI10.23638/LMCS-13(3:33)2017zbMath1427.68185arXiv1702.01804MaRDI QIDQ5367072

Damien Pous, Paul Brunet

Publication date: 12 October 2017

Full work available at URL: https://arxiv.org/abs/1702.01804

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

zbMATH Keywords

Petri netsgraphsdecidabilityKleene theoremKleene latticesPetri automataKleene allegories

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks ⋮ On series-parallel pomset languages: rationality, context-freeness and automata ⋮ Completeness for Identity-free Kleene Lattices ⋮ Reversible Kleene lattices

This page was built for publication: