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.
This work has been partially supported by Agence Nationale pour la Recherche via the project PANDA (Parallel and Distributed Analysis) ANR-09-BLAN-0169-02.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bournez, O., Maler, O., Pnueli, A.: Orthogonal polyhedra: Representation and computation. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol. 1569, p. 46. Springer, Heidelberg (1999)
Carson, S.D., Reynolds Jr., P.F.: The geometry of semaphore programs. ACM Transactions on Programming Languages and Systems, 25–53 (1987)
Corradini, F., Gorrieri, R., Roccetti, R.: Performance Preorder and Competitive Equivalence. Acta Inf. 34, 805–835 (1997)
Dijkstra, E.W.: Cooperating sequential processes. In: Programming Languages: NATO Advanced Study Institute, pp. 43–112. Academic Press, London (1968)
Fajstrup, L., Goubault, E., Haucourt, E., Raußen, M.: Component categories and the fundamental category. App. Cat. Struct. 12, 81–108 (2004)
Goubault, E., Haucourt, E.: A practical application of geometric semantics to static analysis of concurrent programs. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 503–517. Springer, Heidelberg (2005)
Goubault, E., Haucourt, E.: Component categories and the fundamental category II. App. Cat. Struct. 15 (2007)
Groote, J.F., Moller, F.: Verification of Parallel Systems via Decomposition. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 62–76. Springer, Heidelberg (1992)
Haefliger, A.: Complexes of groups and orbihedra. In: Group theory from a geometrical viewpoint, pp. 504–540. World Scientific, Singapore (1991)
Haefliger, A.: Extension of complexes of groups. Annales de l’institut Fourrier 42(1-2), 275–311 (1992), http://www.numdam.org/
Hashimoto, J.: On direct product decomposition of partially ordered sets. Annals of Mathematics 54, 315–318 (1951)
Haucourt, E.: Categories of components and Loop-free categories. Theory and Applications of Categories 16(27), 736–770 (2006)
Lang, S.: Algebra. Springer, Heidelberg (2002) (4th corrected printing)
Luttik, B., van Oostrom, V.: Decomposition orders: another generalisation of the fundamental theorem of arithmetic. Theor. Comp. Sci. 335, 147–186 (2005)
Milner, R., Moller, F.: Unique Decomposition of Processes. Theor. Comp. Sci. 107, 357–363 (1993)
Nachbin, L.: Topology and Order. Van Nostrand Mathematical Studies, vol. 4. Van Nostrand, Princeton (1965)
Thao, D.: Methods and Tools for Computer Aided Design of Embedded Systems. HDR Thesis, ch. 5 (2009)
Winskel, G.: Handbook of Logic in Computer Science. Semantic Modelling, vol. 4. ch. 1. Oxford University Press, Oxford (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balabonski, T., Haucourt, E. (2010). A Geometric Approach to the Problem of Unique Decomposition of Processes. In: Gastin, P., Laroussinie, F. (eds) CONCUR 2010 - Concurrency Theory. CONCUR 2010. Lecture Notes in Computer Science, vol 6269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15375-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-15375-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15374-7
Online ISBN: 978-3-642-15375-4
eBook Packages: Computer ScienceComputer Science (R0)