A Nice Labelling for Tree-Like Event Structures of Degree 3

DOI10.1007/978-3-540-74407-8_11MaRDI QIDQ3525635zbMATH OpenOpenAlexFDO

Authors Luigi Santocanale

Publication date 18 September 2008

Published in CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74407-8_11

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A Nice labelling for tree-like event structures of degree 3
• Finite labelling problem in event structures
• Labellings of trees with maximum degree three -- an improved bound
• Nice labeling problem for event structures: a counterexample
• scientific article; zbMATH DE number 67680

Cited in

(6)

• Finite labelling problem in event structures
• Topological properties of event structures
• Nice labeling problem for event structures: a counterexample
• scientific article; zbMATH DE number 67680 (Why is no real title available?)
• scientific article; zbMATH DE number 4770 (Why is no real title available?)
• A Nice labelling for tree-like event structures of degree 3

This page was built for publication: A Nice Labelling for Tree-Like Event Structures of Degree 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525635)