Petri Automata for Kleene Allegories

DOI10.1109/LICS.2015.17MaRDI QIDQ4635792zbMATHOpenAlexFDO

Authors Paul Brunet, Damien Pous

Publication date 23 April 2018

Published in 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/lics.2015.17

zbMATH Keywords

algebradecidabilityfinite automataformal languageslattice theoryPetri nets

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)

Recommendations

• Petri automata
• scientific article; zbMATH DE number 1973122
• Automata, Languages and Programming
• Petri nets and algebraic specifications
• scientific article; zbMATH DE number 803796
• Petri nets, algebras, morphisms, and compositionality
• scientific article; zbMATH DE number 4131674
• scientific article; zbMATH DE number 1490008
• Pushdown automata, multiset automata, and Petri nets
• On the algebraic structure of Petri nets

Cited in

(10)

• On series-parallel pomset languages: rationality, context-freeness and automata
• scientific article; zbMATH DE number 7559485 (Why is no real title available?)
• Petri automata
• Reversible Kleene lattices
• On the positive calculus of relations with transitive closure
• The Kleene Equality for Graphs
• Partial derivatives on graphs for Kleene allegories
• scientific article; zbMATH DE number 7649887 (Why is no real title available?)
• Completeness for identity-free Kleene lattices
• Completeness theorems for Kleene algebra with tests and top

This page was built for publication: Petri Automata for Kleene Allegories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635792)