Imperative process algebra with abstraction

DOI10.7561/SACS.2022.1.137MaRDI QIDQ6588076zbMATH OpenFDO

Authors C. A. Middelburg

Publication date 15 August 2024

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

zbMATH Keywords

abstractionbranching bisimulationinformation-flow securityimperative process algebradata non-interference with interactions

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Imperative process algebra and models of parallel computation
• Linda-based applicative and imperative process algebras
• scientific article; zbMATH DE number 1863164
• scientific article; zbMATH DE number 4011914
• Computing with actions and communications

Cited in

(2)

• Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
• Imperative process algebra and models of parallel computation

This page was built for publication: Imperative process algebra with abstraction

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