Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity

Open Access
Authors
  • A. Silva
Publication date 07-2023
Host editors
  • K. Etessami
  • U. Feige
  • G. Puppis
Book title 50th International Colloquium on Automata, Languages, and Programming
Book subtitle ICALP 2023, July 10-14, 2023, Paderborn, Germany
ISBN (electronic)
  • 9783959772785
Series Leibniz International Proceedings in Informatics
Event 50th International Colloquium on Automata, Languages, and Programming
Article number 136
Number of pages 20
Publisher Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract We introduce Probabilistic Guarded Kleene Algebra with Tests (ProbGKAT), an extension of GKAT that allows reasoning about uninterpreted imperative programs with probabilistic branching. We give its operational semantics in terms of special class of probabilistic automata. We give a sound and complete Salomaa-style axiomatisation of bisimilarity of ProbGKAT expressions. Finally, we show that bisimilarity of ProbGKAT expressions can be decided in O(n3logn) time via a generic partition refinement algorithm.
Document type Conference contribution
Note Longer version available on ArXiv.
Language English
Published at https://doi.org/10.4230/LIPIcs.ICALP.2023.136 https://doi.org/10.48550/arXiv.2305.01755
Downloads
LIPIcs.ICALP.2023.136 (Final published version)
2305.01755 (Other version)
Permalink to this page
Back