Deadlock and fictitiousness problem in parallel program specifications

DOI10.1007/BF02367758MaRDI QIDQ1905211zbMATH OpenFDO

Authors V. P. Panfilenko

Publication date 8 February 1996

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of universal algebra in computer science (08A70)

Cites work

• Consistency of formalized specifications in multilevel programming

This page was built for publication: Deadlock and fictitiousness problem in parallel program specifications

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