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

DOI10.1016/j.ic.2009.05.006zbMath1205.68249MaRDI QIDQ979077

Luigi Santocanale

Publication date: 25 June 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.05.006

Mathematics Subject Classification ID

68Q45: Formal languages and automata

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

Related Items

The Configuration Space of a Robotic Arm in a Tunnel, On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes

Uses Software

• POEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On stable domains
• Modeling concurrency with partial orders
• Petri nets, event structures and domains. I
• Event structures and trace monoids
• Context-free event domains are recognizable
• Finite labelling problem in event structures
• Incidence matrices and interval graphs
• Unfoldings: A partial-order approach to model checking.
• A solution to Dilworth's congruence lattice problem
• A decomposition theorem for partially ordered sets
• Topological Properties of Event Structures
• The Implementation of Mazurkiewicz Traces in POEM
• Notes on finite asynchronous automata
• CONCURRENT AUTOMATA AND DOMAINS
• Sur le coloriage des graphs
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science