A Note on Generating Sets for Semiflows
Gerard Memmi

TL;DR
This paper explores the properties of finite generating sets for semiflows in Petri Nets, analyzing their characteristics over various algebraic structures to uncover new theoretical insights.
Contribution
It introduces new results on generating sets for semiflows over semi rings and fields, enhancing understanding of their algebraic structure.
Findings
New characterizations of generating sets over semi rings and fields
Identification of conditions for finite generation of semiflows
Insights into the algebraic structure of semiflows in Petri Nets
Abstract
In this short note, we are interested in discussing characteristics of finite generating sets for , the set of all semiflows with non negative coefficients of a Petri Net. By systematically positioning these results over semi rings such as or then over a field such as , we were able to discover a handful of new results
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPetri Nets in System Modeling · semigroups and automata theory · Business Process Modeling and Analysis
