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

DOI10.1142/S0129054190000205zbMath0732.68074OpenAlexW2101125331MaRDI QIDQ3358247

Ugo Montanari, Roberto Gorrieri

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

concurrencyprocess description languagesatomic action refinementobservational congruences

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)

Related Items (5)

Language Representability of Finite P/T Nets ⋮ Processes with infinite liveness requirements ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Processes with local and global liveness requirements ⋮ Progress assumption in concurrent systems

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