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.DISC.2022.15
URN: urn:nbn:de:0030-drops-172064
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/17206/
Go to the corresponding LIPIcs Volume Portal

Civit, Pierre ; Potop-Butucaru, Maria

Dynamic Probabilistic Input Output Automata

pdf-format:
LIPIcs-DISC-2022-15.pdf (1 MB)

Abstract

We present probabilistic dynamic I/O automata, a framework to model dynamic probabilistic systems. Our work extends dynamic I/O Automata formalism of Attie & Lynch [Paul C. Attie and Nancy A. Lynch, 2016] to the probabilistic setting. The original dynamic I/O Automata formalism included operators for parallel composition, action hiding, action renaming, automaton creation, and behavioral sub-typing by means of trace inclusion. They can model mobility by using signature modification. They are also hierarchical: a dynamically changing system of interacting automata is itself modeled as a single automaton. Our work extends all these features to the probabilistic setting. Furthermore, we prove necessary and sufficient conditions to obtain the monotonicity of automata creation/destruction with implementation preorder. Our construction uses a novel proof technique based on homomorphism that can be of independent interest. Our work lays down the foundations for extending composable secure-emulation of Canetti et al. [Ran Canetti et al., 2007] to dynamic settings, an important tool towards the formal verification of protocols combining probabilistic distributed systems and cryptography in dynamic settings (e.g. blockchains, secure distributed computation, cybersecure distributed protocols, etc).

BibTeX - Entry

@InProceedings{civit_et_al:LIPIcs.DISC.2022.15,
  author =	{Civit, Pierre and Potop-Butucaru, Maria},
  title =	{{Dynamic Probabilistic Input Output Automata}},
  booktitle =	{36th International Symposium on Distributed Computing (DISC 2022)},
  pages =	{15:1--15:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-255-6},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{246},
  editor =	{Scheideler, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/17206},
  URN =		{urn:nbn:de:0030-drops-172064},
  doi =		{10.4230/LIPIcs.DISC.2022.15},
  annote =	{Keywords: Automata, Distributed Computing, Formal Verification, Dynamic systems}
}

Keywords: Automata, Distributed Computing, Formal Verification, Dynamic systems
Collection: 36th International Symposium on Distributed Computing (DISC 2022)
Issue Date: 2022
Date of publication: 17.10.2022

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