Location of Repository

One-counter circuits

By Vladimir A. Bashkin

Abstract

One-counter nets are nondeterministic one-counter automata without zero-testing (Petri Nets with at most one unbounded place). A one-counter circuit of length ∆ is a strongly connected one-counter net, such that ∆ is a greatest common divisor of effects of all its cycles. A circuit has simple periodic behaviour: for any control state the set of corresponding reachable counter values is an arithmetic progression with difference ∆ (with an exception of a bounded subset). Properties of circuits and general one-counter nets are studied. It is shown that the infinite behaviour of a one-counter net can be represented by a composition of a finite set of circuits

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.417.2095
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ceur-ws.org/Vol-928/002... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.