2022/11/18 by Gérard Memmi, Memmi, Gerard
Business, Management and Accounting · Computer Science · #Business Process Modeling and Analysis #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Petri Nets in System Modeling #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2211.10405
openalex publication_date 2022/11/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this short note, we are interested in discussing characteristics of finite generating sets for F, the set of all semiflows with non negative coefficients of a Petri Net. By systematically positioning these results over semi rings such as ℕ or \mathbbQ+ then over a field such as ℚ, we were able to discover a handful of new results