A geometric approach to the problem of unique decomposition of processes

DOI10.1007/978-3-642-15375-4_10MaRDI QIDQ3584926zbMATH OpenOpenAlexFDO

Authors Thibaut Balabonski, Emmanuel Haucourt

Publication date 31 August 2010

Published in CONCUR 2010 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1004.2780

zbMATH Keywords

concurrencydecomposition of processesgeometric semanticsMilner problem

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs are given a geometric semantics using cubical areas, for which a unique factorization theorem is proved. An effective factorization method which is correct and complete with respect to the geometric semantics is derived from the factorization theorem. This algorithm is implemented in the static analyzer ALCOOL.

Recommendations

• scientific article; zbMATH DE number 4777
• Mathematical Foundations of Computer Science 2003
• Unique decomposition of processes
• Effective decomposability of sequential behaviours
• On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus

Cited in

(4)

• Unique decomposition of homogeneous languages and application to isothetic regions
• The geometry of conservative programs
• CONCUR 2005 – Concurrency Theory
• Unique parallel decomposition in branching and weak bisimulation semantics

This page was built for publication: A geometric approach to the problem of unique decomposition of processes

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