Topological Properties of Event Structures

DOI10.1016/j.entcs.2009.02.023zbMath1339.68191OpenAlexW2035638900MaRDI QIDQ2810963

Luigi Santocanale

Publication date: 6 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.023

zbMATH Keywords

clique complexesevent structuresnice labelling problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of simplicial complexes (05E45)

Related Items (1)

A Nice labelling for tree-like event structures of degree 3

Cites Work

• Unnamed Item
• An event structure semantics for general Petri nets
• Finite labelling problem in event structures
• Contractible transformations do not change the homology groups of graphs
• A decomposition theorem for partially ordered sets
• The topological structure of asynchronous computability
• An extension of the notions of traces and of asynchronous automata
• Geometry and concurrency: a user's guide
• Sur le coloriage des graphs

This page was built for publication: Topological Properties of Event Structures