2 Search Results for "Sabellek, Leif"

Document
DOI: 10.4230/LIPIcs.CSL.2024.31
Remarks on Parikh-Recognizable Omega-languages

Authors: Mario Grobler, Leif Sabellek, and Sebastian Siebertz

Published in: LIPIcs, Volume 288, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)

Abstract
Several variants of Parikh automata on infinite words were recently introduced by Guha et al. [FSTTCS, 2022]. We show that one of these variants coincides with blind counter machine as introduced by Fernau and Stiebe [Fundamenta Informaticae, 2008]. Fernau and Stiebe showed that every ω-language recognized by a blind counter machine is of the form ⋃_iU_iV_i^ω for Parikh recognizable languages U_i, V_i, but blind counter machines fall short of characterizing this class of ω-languages. They posed as an open problem to find a suitable automata-based characterization. We introduce several additional variants of Parikh automata on infinite words that yield automata characterizations of classes of ω-language of the form ⋃_iU_iV_i^ω for all combinations of languages U_i, V_i being regular or Parikh-recognizable. When both U_i and V_i are regular, this coincides with Büchi’s classical theorem. We study the effect of ε-transitions in all variants of Parikh automata and show that almost all of them admit ε-elimination. Finally we study the classical decision problems with applications to model checking.
Cite as

Mario Grobler, Leif Sabellek, and Sebastian Siebertz. Remarks on Parikh-Recognizable Omega-languages. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 288, pp. 31:1-31:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{grobler_et_al:LIPIcs.CSL.2024.31,
  author =	{Grobler, Mario and Sabellek, Leif and Siebertz, Sebastian},
  title =	{{Remarks on Parikh-Recognizable Omega-languages}},
  booktitle =	{32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)},
  pages =	{31:1--31:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-310-2},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{288},
  editor =	{Murano, Aniello and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.31},
  URN =		{urn:nbn:de:0030-drops-196743},
  doi =		{10.4230/LIPIcs.CSL.2024.31},
  annote =	{Keywords: Parikh automata, blind counter machines, infinite words, B\"{u}chi’s theorem}
}
Document
Short Paper
DOI: 10.4230/LIPIcs.COSIT.2019.28
Granular Spatial Calculi of Relative Directions or Movements with Parallelism: Consistent Account (Short Paper)

Authors: Reinhard Moratz, Leif Sabellek, and Thomas Schneider

Published in: LIPIcs, Volume 142, 14th International Conference on Spatial Information Theory (COSIT 2019)

Abstract
The OPRA* calculus family, originally suggested by Frank Dylla, adds parallelism to the OPRA calculus family which is very popular in Qualitative Spatio-temporal Reasoning (QSTR). Adding parallelism enables the direct representation of parallel moving objects, which is relevant in many applications like traffic monitoring. However, it turned out that it is hard to derive a sound geometric analysis. So far no sound spatial reasoning was supported. Our new generic analysis based on combining condensed semantics lower bounds with upper bounds from algebraic mappings of related calculi already leads to a close and sound approximization. This approximization can be easily augmented with a manual analysis of few geometrically underconstrained cases and then yields a complete analysis of possible configurations in this oriented point framework. This for the first time enables sound standard QSTR constraint reasoning for the OPRA* calculus family.
Cite as

Reinhard Moratz, Leif Sabellek, and Thomas Schneider. Granular Spatial Calculi of Relative Directions or Movements with Parallelism: Consistent Account (Short Paper). In 14th International Conference on Spatial Information Theory (COSIT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 142, pp. 28:1-28:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{moratz_et_al:LIPIcs.COSIT.2019.28,
  author =	{Moratz, Reinhard and Sabellek, Leif and Schneider, Thomas},
  title =	{{Granular Spatial Calculi of Relative Directions or Movements with Parallelism: Consistent Account}},
  booktitle =	{14th International Conference on Spatial Information Theory (COSIT 2019)},
  pages =	{28:1--28:9},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-115-3},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{142},
  editor =	{Timpf, Sabine and Schlieder, Christoph and Kattenbeck, Markus and Ludwig, Bernd and Stewart, Kathleen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2019.28},
  URN =		{urn:nbn:de:0030-drops-111206},
  doi =		{10.4230/LIPIcs.COSIT.2019.28},
  annote =	{Keywords: qualitative spatial-temporal reasoning, composition table, condensed semantics, homomorphic embeddings}
}
  • Refine by Author
  • 2 Sabellek, Leif
  • 1 Grobler, Mario
  • 1 Moratz, Reinhard
  • 1 Schneider, Thomas
  • 1 Siebertz, Sebastian

  • Refine by Classification
  • 1 Computing methodologies → Spatial and physical reasoning
  • 1 Computing methodologies → Symbolic calculus algorithms
  • 1 Information systems → Spatial-temporal systems
  • 1 Theory of computation → Automata over infinite objects

  • Refine by Keyword
  • 1 Büchi’s theorem
  • 1 Parikh automata
  • 1 blind counter machines
  • 1 composition table
  • 1 condensed semantics
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2019
  • 1 2024

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact