On concurrent program algebra and demonic automata

DOI10.1007/978-3-031-77019-7_7MaRDI QIDQ6979827zbMATH OpenFDO

Authors Emil Sekerinski

Publication date 23 May 2025

Full work available at URL https://doi.org/10.1007/978-3-031-77019-7_7

zbMATH Keywords

automated verificationconcurrent Kleene algebrafinite state automataregular expressions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A completeness theorem for Kleene algebras and the algebra of regular events
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Checking NFA equivalence with bisimulations up to congruence
• Concurrent Kleene algebra and its foundations
• Developments in concurrent Kleene algebra
• scientific article; zbMATH DE number 3463159 (Why is no real title available?)
• scientific article; zbMATH DE number 873168 (Why is no real title available?)
• Kleene getting lazy
• On Equivalence Checking of Nondeterministic Finite Automata
• Refinement Calculus
• Succinctness of the Complement and Intersection of Regular Expressions
• Testing the equivalence of regular languages
• The laws of Occam programming

This page was built for publication: On concurrent program algebra and demonic automata

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