Combinatorics of labelling in higher-dimensional automata

DOI10.1016/j.tcs.2009.11.013zbMath1191.68384arXiv0808.1667OpenAlexW1966230673MaRDI QIDQ960860

Philippe Gaucher

Publication date: 29 March 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

process algebraconcurrencypresheafleft adjointprecubical set

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Unnamed Item ⋮ Unnamed Item ⋮ Weak morphisms of higher dimensional automata ⋮ Formal Relationships Between Geometrical and Classical Models for Concurrency ⋮ On symmetric higher-dimensional automata and bisimilarity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Hecke group algebra of a Coxeter group and its representation theory.
• On the algebra of cubes
• Topological deformation of higher dimensional automata
• Some geometric perspectives in concurrency theory
• A model category for the homotopy theory of concurrency
• Multiple categories: The equivalence of a globular and a cubical approach
• Towards a homotopy theory of process algebra
• On the expressiveness of higher dimensional automata
• Homotopy theory of diagrams
• A Theory of Communicating Sequential Processes
• Homotopy colimits in the category of small categories
• Homotopy invariants of higher dimensional categories and concurrency in computer science
• Sheafifiable homotopy model categories
• A convenient category for directed homotopy
• Foundations of Software Science and Computational Structures

This page was built for publication: Combinatorics of labelling in higher-dimensional automata