Time-stamps for Mazurkiewicz traces.

DOI10.1016/j.tcs.2006.01.026zbMath1160.68433OpenAlexW1991689947MaRDI QIDQ2490824

Wiesław Zielonka

Publication date: 18 May 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.026

zbMATH Keywords

asynchronous automataMazurkiewicz tracesfinite time-stamps

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A framework for synthesis of communicating decentralised supervisors for discrete-event systems

Cites Work

• Asynchronous mappings and asynchronous cellular automata
• Some combinatorial aspects of time-stamp systems
• Notes on finite asynchronous automata
• Keeping track of the latest gossip in a distributed system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item