A geometric approach to the problem of unique decomposition of processes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationCONCUR 2010 - Concurrency Theory - 21st International Conference, CONCUR 2010, Proceedings
PublisherSpringer Verlag
Pages132-146
Number of pages15
ISBN (Print)3642153747, 9783642153747
DOIs
Publication statusPublished - 1 Jan 2010
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6269 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Concurrency
  • Decomposition of processes
  • Geometric semantics
  • Milner problem

Fingerprint

Dive into the research topics of 'A geometric approach to the problem of unique decomposition of processes'. Together they form a unique fingerprint.

Cite this