Verification of dynamic register automata

DOI10.4230/LIPICS.FSTTCS.2014.653zbMATH Open1360.68575OpenAlexW23130548MaRDI QIDQ2978554FDOQ2978554

Mohamed Faouzi Atig, Othmane Rezine, Parosh A. Abdulla, Ahmet Kara

Publication date: 25 April 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2014.653

Recommendations

• History-register automata
• History-register automata
• Parameterized verification of broadcast networks of register automata
• $$\textsc {Reach}$$ on Register Automata via History Independence
• scientific article; zbMATH DE number 7361373

zbMATH Keywords

verificationreachability problemregister automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (3)

• Modeling Actor Systems Using Dynamic I/O Automata
• Parameterized broadcast networks with registers: from NP to the frontiers of decidability
• Automatic verification of fault-tolerant register emulations

This page was built for publication: Verification of dynamic register automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978554)