Topological properties of event structures
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial aspects of simplicial complexes (05E45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- A decomposition theorem for partially ordered sets
- An event structure semantics for general Petri nets
- An extension of the notions of traces and of asynchronous automata
- Contractible transformations do not change the homology groups of graphs
- Finite labelling problem in event structures
- Geometry and concurrency: a user's guide
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- Sur le coloriage des graphs
- The topological structure of asynchronous computability
Cited in
(4)
This page was built for publication: Topological properties of event structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810963)