The affine hull of a binary automaton is computable in polynomial time

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Leroux, J. (2004). The affine hull of a binary automaton is computable in polynomial time. In Electronic Notes in Theoretical Computer Science (Vol. 98, pp. 89–104). https://doi.org/10.1016/j.entcs.2003.10.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free