Axiomatising Finite Concurrent Processes
From MaRDI portal
Publication:3817589
DOI10.1137/0217063zbMath0666.68024MaRDI 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
concurrent processes; concurrency; proof system; observational equivalence; noninterleaving semantics
68Q55: Semantics in the theory of computing
68Q60: Specification and verification (program logics, model checking, etc.)
68Q65: Abstract data types; algebraic specification
68N25: Theory of operating systems
Related Items
A fully abstract denotational model for observational precongruence, On the semantics of durational actions, Observing localities, Refinement of actions in event structures and causal trees, \(\tau\)-bisimulations and full abstraction for refinement of actions, A theory of processes with localities, The difference between splitting in \(n\) and \(n+1\), CCS with Hennessy's merge has no finite-equational axiomatization, Timing and causality in process algebra