TY - GEN
T1 - Mutually Accepting Capacitated Automata
AU - Alon, Ravid
AU - Kupferman, Orna
N1 - Publisher Copyright: © 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - We study capacitated automata (CAs)[10], where transitions correspond to resources and have capacities, bounding the number of times they may be traversed. We follow the utilization semantics of CAs and view them as recognizers of multi-languages – sets of multisets of words, where a multiset S of words is in the multi-language of a CA A if all the words in S can be mutually accepted by A: the multiset of runs on all the words in S together respects the bounds induced by the capacities. Thus, capacitated automata model possible utilizations of systems with bounded resources. We study the basic properties of CAs: their expressive power in the nondeterministic and deterministic models, closure under classical operations, and the complexity of basic decision problems.
AB - We study capacitated automata (CAs)[10], where transitions correspond to resources and have capacities, bounding the number of times they may be traversed. We follow the utilization semantics of CAs and view them as recognizers of multi-languages – sets of multisets of words, where a multiset S of words is in the multi-language of a CA A if all the words in S can be mutually accepted by A: the multiset of runs on all the words in S together respects the bounds induced by the capacities. Thus, capacitated automata model possible utilizations of systems with bounded resources. We study the basic properties of CAs: their expressive power in the nondeterministic and deterministic models, closure under classical operations, and the complexity of basic decision problems.
UR - http://www.scopus.com/inward/record.url?scp=85097391442&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-62536-8_1
DO - 10.1007/978-3-030-62536-8_1
M3 - منشور من مؤتمر
SN - 9783030625351
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 12
BT - Descriptional Complexity of Formal Systems - 22nd International Conference, 2020, Proceedings
A2 - Jirásková, Galina
A2 - Pighizzini, Giovanni
PB - Springer Science and Business Media Deutschland GmbH
T2 - 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020
Y2 - 24 August 2020 through 26 August 2020
ER -