Combinatorics of labelling in higher-dimensional automata
From MaRDI portal
Abstract: The main idea for interpreting concurrent processes as labelled precubical sets is that a given set of n actions running concurrently must be assembled to a labelled n-cube, in exactly one way. The main ingredient is the non-functorial construction called labelled directed coskeleton. It is defined as a subobject of the labelled coskeleton, the latter coinciding in the unlabelled case with the right adjoint to the truncation functor. This non-functorial construction is necessary since the labelled coskeleton functor of the category of labelled precubical sets does not fulfil the above requirement. We prove in this paper that it is possible to force the labelled coskeleton functor to be well-behaved by working with labelled transverse symmetric precubical sets. Moreover, we prove that this solution is the only one. A transverse symmetric precubical set is a precubical set equipped with symmetry maps and with a new kind of degeneracy map called transverse degeneracy. Finally, we also prove that the two settings are equivalent from a directed algebraic topological viewpoint. To illustrate, a new semantics of CCS, equivalent to the old one, is given.
Recommendations
Cites work
- A convenient category for directed homotopy
- A model category for the homotopy theory of concurrency
- A Theory of Communicating Sequential Processes
- Combinatorics of branchings in higher dimensional automata
- Foundations of Software Science and Computational Structures
- Homotopy colimits in the category of small categories
- Homotopy invariants of higher dimensional categories and concurrency in computer science
- Homotopy theory of diagrams
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 1226952 (Why is no real title available?)
- scientific article; zbMATH DE number 1324388 (Why is no real title available?)
- scientific article; zbMATH DE number 575948 (Why is no real title available?)
- scientific article; zbMATH DE number 2051884 (Why is no real title available?)
- scientific article; zbMATH DE number 1924514 (Why is no real title available?)
- scientific article; zbMATH DE number 1860105 (Why is no real title available?)
- scientific article; zbMATH DE number 937397 (Why is no real title available?)
- Multiple categories: The equivalence of a globular and a cubical approach
- On the algebra of cubes
- On the expressiveness of higher dimensional automata
- Poset topology: tools and applications
- Sheafifiable homotopy model categories
- Some geometric perspectives in concurrency theory
- The Hecke group algebra of a Coxeter group and its representation theory.
- Topological deformation of higher dimensional automata
- Topology and groupoids
- Towards a homotopy theory of process algebra
Cited in
(12)- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
- On symmetric higher-dimensional automata and bisimilarity
- Weak morphisms of higher dimensional automata
- Number of labelings of definite automata graphs
- Applications of automata and graphs: Labeling operators in Hilbert space. II.
- LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES
- Formal relationships between geometrical and classical models for concurrency
- Higher-dimensional automata modeling shared-variable systems
- Combinatorics of past-similarity in higher dimensional transition systems
- Directed degeneracy maps for precubical sets
- On the homology language of HDA models of transition systems
- On the topology of concurrent systems
This page was built for publication: Combinatorics of labelling in higher-dimensional automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960860)
