Journal article icon

Journal article

Context-free commutative grammars with integer counters and resets

Abstract:

We study the computational complexity of reachability, coverability and inclusion for extensions of context-free commutative grammars with integer counters and reset operations on them. Those grammars can alternatively be viewed as an extension of communication-free Petri nets. Our main results are that reachability and coverability are inter-reducible and both NP-complete. In particular, this class of commutative grammars enjoys semi-linear reachability sets. We also show that the inclusion ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted manuscript

Actions


Access Document


Files:
Publisher copy:
10.1016/j.tcs.2016.06.017

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
More from this funder
Funding agency for:
Chistikov, D
Publisher:
Elsevier Publisher's website
Journal:
Theoretical Computer Science Journal website
Publication date:
2016-06-05
Acceptance date:
2016-06-10
DOI:
URN:
uuid:08f16169-349f-4857-98de-0b9ce5bd4c6e
Source identifiers:
616395
Local pid:
pubs:616395

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP