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

  • Leroux J
  • 2

    Readers

    Mendeley users who have this article in their library.
  • 6

    Citations

    Citations of this article.

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.

Author-supplied keywords

  • Affine hull
  • Binary automaton
  • NDD
  • Place invariant
  • Presburger

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Jérôme Leroux

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free