Simplicial models for trace spaces. II: General higher dimensional automata (Q441103): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The aim of this paper is to describe a general method that determines the space of directed paths of a higher dimensional automaton (i.e. in this paper a finite non-selflinked precubical complex) with given end points as the nerve of a particular category. The author generalizes previous results obtained in the case of semaphore models. The new method applies for models in which directed loops occur in the processes involved. The author starts from the nonbranching and nonlooping case in which these spaces are either empty or contractible. Then the branching (and still nonlooping) case is treated by considering the nerve of the covering given by the nonbranching subcomplexes. Finally the case in which non-trivial directed loops occur is treated using the nonlooping length covering of \(d\)-spaces which deloops all non-trivial directed loops.
Property / review text: The aim of this paper is to describe a general method that determines the space of directed paths of a higher dimensional automaton (i.e. in this paper a finite non-selflinked precubical complex) with given end points as the nerve of a particular category. The author generalizes previous results obtained in the case of semaphore models. The new method applies for models in which directed loops occur in the processes involved. The author starts from the nonbranching and nonlooping case in which these spaces are either empty or contractible. Then the branching (and still nonlooping) case is treated by considering the nerve of the covering given by the nonbranching subcomplexes. Finally the case in which non-trivial directed loops occur is treated using the nonlooping length covering of \(d\)-spaces which deloops all non-trivial directed loops. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Philippe Gaucher / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 55P10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 55P15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 55U10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q55 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6068613 / rank
 
Normal rank
Property / zbMATH Keywords
 
higher dimensional automata
Property / zbMATH Keywords: higher dimensional automata / rank
 
Normal rank
Property / zbMATH Keywords
 
execution path
Property / zbMATH Keywords: execution path / rank
 
Normal rank
Property / zbMATH Keywords
 
poset category
Property / zbMATH Keywords: poset category / rank
 
Normal rank
Property / zbMATH Keywords
 
directed loop
Property / zbMATH Keywords: directed loop / rank
 
Normal rank
Property / zbMATH Keywords
 
arc length
Property / zbMATH Keywords: arc length / rank
 
Normal rank
Property / zbMATH Keywords
 
covering
Property / zbMATH Keywords: covering / rank
 
Normal rank
Property / zbMATH Keywords
 
homotopy equivalence
Property / zbMATH Keywords: homotopy equivalence / rank
 
Normal rank

Revision as of 02:04, 30 June 2023

scientific article
Language Label Description Also known as
English
Simplicial models for trace spaces. II: General higher dimensional automata
scientific article

    Statements

    Simplicial models for trace spaces. II: General higher dimensional automata (English)
    0 references
    0 references
    20 August 2012
    0 references
    The aim of this paper is to describe a general method that determines the space of directed paths of a higher dimensional automaton (i.e. in this paper a finite non-selflinked precubical complex) with given end points as the nerve of a particular category. The author generalizes previous results obtained in the case of semaphore models. The new method applies for models in which directed loops occur in the processes involved. The author starts from the nonbranching and nonlooping case in which these spaces are either empty or contractible. Then the branching (and still nonlooping) case is treated by considering the nerve of the covering given by the nonbranching subcomplexes. Finally the case in which non-trivial directed loops occur is treated using the nonlooping length covering of \(d\)-spaces which deloops all non-trivial directed loops.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    higher dimensional automata
    0 references
    execution path
    0 references
    poset category
    0 references
    directed loop
    0 references
    arc length
    0 references
    covering
    0 references
    homotopy equivalence
    0 references