License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2023.39
URN: urn:nbn:de:0030-drops-190339
URL: https://drops.dagstuhl.de/opus/volltexte/2023/19033/
Go to the corresponding LIPIcs Volume Portal


Anand, Ashwani ; Zetzsche, Georg

Priority Downward Closures

pdf-format:
LIPIcs-CONCUR-2023-39.pdf (0.8 MB)


Abstract

When a system sends messages through a lossy channel, then the language encoding all sequences of messages can be abstracted by its downward closure, i.e. the set of all (not necessarily contiguous) subwords. This is useful because even if the system has infinitely many states, its downward closure is a regular language. However, if the channel has congestion control based on priorities assigned to the messages, then we need a finer abstraction: The downward closure with respect to the priority embedding. As for subword-based downward closures, one can also show that these priority downward closures are always regular.
While computing finite automata for the subword-based downward closure is well understood, nothing is known in the case of priorities. We initiate the study of this problem and provide algorithms to compute priority downward closures for regular languages, one-counter languages, and context-free languages.

BibTeX - Entry

@InProceedings{anand_et_al:LIPIcs.CONCUR.2023.39,
  author =	{Anand, Ashwani and Zetzsche, Georg},
  title =	{{Priority Downward Closures}},
  booktitle =	{34th International Conference on Concurrency Theory (CONCUR 2023)},
  pages =	{39:1--39:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-299-0},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{279},
  editor =	{P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/19033},
  URN =		{urn:nbn:de:0030-drops-190339},
  doi =		{10.4230/LIPIcs.CONCUR.2023.39},
  annote =	{Keywords: downward closure, priority order, pushdown automata, non-deterministic finite automata, abstraction, computability}
}

Keywords: downward closure, priority order, pushdown automata, non-deterministic finite automata, abstraction, computability
Collection: 34th International Conference on Concurrency Theory (CONCUR 2023)
Issue Date: 2023
Date of publication: 07.09.2023


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI