Finite-state concurrent programs can be expressed succinctly in triple normal form

DOI10.1016/J.IPL.2017.02.004MaRDI QIDQ522959zbMATH OpenOpenAlexFDO

Authors Paul C. Attie

Publication date 20 April 2017

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2017.02.004

zbMATH Keywords

concurrencyexpressive completenessfinite-state concurrent programs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Finite-state concurrent programs can be expressed in pairwise normal form
• Two normal form theorems for CSP programs
• Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs)
• On transformations of concurrent-object programs
• On the power of bounded concurrency I

Cites work

• Finite-state concurrent programs can be expressed in pairwise normal form
• How to share concurrent wait-free variables
• Optimal multi-writer multi-reader atomic register
• Optimality of wait-free atomic multiwriter variables
• Programming as a Discipline of Mathematical Nature
• Simple extensions of 1-writer atomic variable constructions to multiwriter ones
• The elusive atomic register
• Using branching time temporal logic to synthesize synchronization skeletons

Cited in

(2)

• On the succinctness of idioms for concurrent programming
• Finite-state concurrent programs can be expressed in pairwise normal form

This page was built for publication: Finite-state concurrent programs can be expressed succinctly in triple normal form

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