Finite labelling problem in event structures

DOI10.1016/0304-3975(94)90065-5zbMath0801.68057OpenAlexW1985467790MaRDI QIDQ1314399

Christine Charretton, Brigitte Rozoy, Marc Roland Assous, Vincent Bouchitte

Publication date: 4 December 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90065-5

zbMATH Keywords

NP-hardevent structuresmodels of parallelismnice labeleling

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

A verified algorithm enumerating event structures ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ A Nice labelling for tree-like event structures of degree 3 ⋮ Topological Properties of Event Structures ⋮ Stable trace automata vs. full trace automata

Cites Work

• Unnamed Item
• Unnamed Item
• Event structures and trace monoids
• A decomposition theorem for partially ordered sets