A note on specifying and verifying concurrent processes

DOI10.1016/0020-0190(84)90028-0zbMATH Open0559.68033OpenAlexW2071904954MaRDI QIDQ2265804FDOQ2265804

Authors: Leszek Holenderski 

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90028-0

zbMATH Keywords

extended regular expressionscountersbinary semaphoresmodel for concurrent processessynchronized shuffleunbounded semaphores

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• Software Descriptions with Flow Expressions
• A calculus of total correctness for communicating processes
• Some Properties of Predicate Transformers
• Implementation approach to parallel systems
• On universality of concurrent expressions with synchronization primitives

This page was built for publication: A note on specifying and verifying concurrent processes

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