Higher Dimensional Automata

Higher Dimensional Automata (HDA), introduced by Pratt and van Glabbeek (1991), are one of models of concurrency, notable for its high expressivity. I will recall the definition of HDA and show how to model ST-structures and Petri nets with HDA. I will define executions of a given HDA and its associated language. I will conclude with relationship between Higher Dimensional Automata and Algebraic Topology.