Axiomatising Finite Concurrent Processes
From MaRDI portal
Publication:3817589
DOI10.1137/0217063zbMath0666.68024OpenAlexW2063465006MaRDI QIDQ3817589
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0217063
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)
Related Items
A theory of processes with localities, Termination, deadlock and divergence, Axiomatising real-timed processes, Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?, Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence), Bisimilarity is not finitely based over BPA with interrupt, The difference between splitting in \(n\) and \(n+1\), Timing and causality in process algebra, On relating concurrency and nondeterminism, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Foundational aspects of multiscale modeling of biological systems with process algebras, \(\tau\)-bisimulations and full abstraction for refinement of actions, The limit of splitn-language equivalence, Observing localities, Refinement of actions in event structures and causal trees, CCS with Hennessy's merge has no finite-equational axiomatization, A fully abstract denotational model for observational precongruence, On the semantics of durational actions, The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems
