Finite labelling problem in event structures
Theoretical Computer Science - Special issue on number theory, combinatorics and applications to computer science
Contractible transformations do not change the homology groups of graphs
Discrete Mathematics
An event structure semantics for general Petri nets
Theoretical Computer Science - Special volume on Petri nets
The topological structure of asynchronous computability
Journal of the ACM (JACM)
The Book of Traces
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
A nice labelling for tree-like event structures of degree 3
Information and Computation
| Hi-index | 0.00 |
Motivated by the nice labelling problem for event structures, we study the topological properties of the associated graphs. For each n=0, we exhibit a graph G"n that cannot occur on an antichain as a subgraph of the graph of an event structure of degree n. The clique complexes of the graphs G"n are disks (n even) and spheres (n odd) in increasing dimensions. We strengthen the result for event structures of degree 3: cycles of length greater than 3 do not occur on antichains as subgraphs. This amounts to saying that the clique complex of the graph of an event structure of degree 3 is acyclic.