Axiomatising Finite Concurrent Processes

DOI10.1137/0217063MaRDI QIDQ3817589zbMATH OpenOpenAlexFDO

Authors Matthew Hennessy

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

zbMATH Keywords

concurrencyconcurrent processesnoninterleaving semanticsobservational equivalenceproof system

Mathematics Subject Classification ID

Theory of operating systems (68N25) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Publication:4733391
• On “Axiomatising Finite Concurrent Processes”
• Trace, failure and testing equivalences for communicating processes
• scientific article; zbMATH DE number 3858386
• A proof-theoretic characterization of observational equivalence

Cited in

(39)

• A proof-theoretic characterization of observational equivalence
• Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
• \(\tau\)-bisimulations and full abstraction for refinement of actions
• Observational structures and their logic
• A complete axiomatisation for observational congruence of finite-state behaviours
• 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
• Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
• scientific article; zbMATH DE number 3858386 (Why is no real title available?)
• scientific article; zbMATH DE number 3872691 (Why is no real title available?)
• Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
• Is Observational Congruence Axiomatisable in Equational Horn Logic?
• scientific article; zbMATH DE number 4104372 (Why is no real title available?)
• Foundational aspects of multiscale modeling of biological systems with process algebras
• On “Axiomatising Finite Concurrent Processes”
• Boundedness analysis of finitely recursive processes. I. Concurrent processes
• The limit of \(\operatorname{split}_n\)-language equivalence
• scientific article; zbMATH DE number 10090 (Why is no real title available?)
• scientific article; zbMATH DE number 4119607 (Why is no real title available?)
• Axiomatizing Petri net concatenable processes
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
• The quest for equational axiomatizations of parallel composition: status and open problems
• Computational and Information Science
• Theoretical Aspects of Computing - ICTAC 2004
• Concurrency cannot be observed, asynchronously
• Termination, deadlock and divergence
• Axiomatising real-timed processes
• A fully abstract denotational model for observational precongruence
• On the semantics of durational actions
• On relating concurrency and nondeterminism
• A fully abstract denotational model for observational precongruence
• Are two binary operators necessary to finitely axiomatise parallel composition?
• Observing localities
• Refinement of actions in event structures and causal trees
• Non finite axiomatisability of weak bisimulation-based congruences
• Axiomatising weak bisimulation congruences over CCS with left merge and communication merge
• Bisimilarity is not finitely based over BPA with interrupt

This page was built for publication: Axiomatising Finite Concurrent Processes

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