TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING

DOI10.1142/S0129054190000205MaRDI QIDQ3358247zbMATH OpenOpenAlexFDO

Authors Roberto Gorrieri, Ugo Montanari

Publication date 1990

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054190000205

zbMATH Keywords

atomic action refinementconcurrencyobservational congruencesprocess description languages

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 92605
• scientific article; zbMATH DE number 176132
• Vertical implementation
• scientific article; zbMATH DE number 176759
• Process simulation and refinement

Cited in

(6)

• Processes with local and global liveness requirements
• Progress assumption in concurrent systems
• Language representability of finite P/T nets
• Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
• Processes with infinite liveness requirements
• scientific article; zbMATH DE number 92605 (Why is no real title available?)

This page was built for publication: TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING

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