2000 character limit reached
A Note on Generating Sets for Semiflows (2211.10405v2)
Published 18 Nov 2022 in cs.FL and cs.DM
Abstract: In this short note, we are interested in discussing characteristics of finite generating sets for $\mathcal{F}$, the set of all semiflows with non negative coefficients of a Petri Net. By systematically positioning these results over semi rings such as $\mathbb{N}$ or $\mathbb{Q+}$ then over a field such as $\mathbb{Q}$, we were able to discover a handful of new results
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.