We present the class of binary automaton, a new representation for the subsets of Nmthat naturally extends the NDD. We prove that the affine hull of the set of vectors represented by a binary automaton is computable in polynomial time. As application, we show that the set of place invariants of a counter system (an extension of the Broadcast Protocols the Reset/Transfer Petri Nets and the linear systems), is computable in polynomial time. © 2004 Published by Elsevier B.V.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below