A product construction for Time Petri nets, combined with an extended state class graph algorithm, computes language intersection efficiently without adding expressive power to the model.
IEEE Transactions on Automatic Control 62(3) (2017)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A State Class Construction for Computing the Intersection of Time Petri Nets Languages
A product construction for Time Petri nets, combined with an extended state class graph algorithm, computes language intersection efficiently without adding expressive power to the model.