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

DOI10.1016/j.ipl.2017.02.004zbMath1405.68069OpenAlexW2606206656MaRDI QIDQ522959

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

expressive completenessconcurrencyfinite-state concurrent programs

Mathematics Subject Classification ID

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

Cites Work

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