Extends Kleene theorems for 1-bounded S-coverable free choice nets with distributed alphabets by dropping the product condition on final markings and giving characterizations for free choice synchronous products and Zielonka automata.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Kleene Theorems for Free Choice Nets Labelled with Distributed Alphabets
Extends Kleene theorems for 1-bounded S-coverable free choice nets with distributed alphabets by dropping the product condition on final markings and giving characterizations for free choice synchronous products and Zielonka automata.