Time-stamps for Mazurkiewicz traces.

DOI10.1016/J.TCS.2006.01.026MaRDI QIDQ2490824zbMATH OpenOpenAlexFDO

Authors 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 automatafinite time-stampsMazurkiewicz traces

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• scientific article; zbMATH DE number 1059327
• scientific article; zbMATH DE number 1114033
• scientific article; zbMATH DE number 4072393
• Interval approximations of message causality in distributed executions

Cites work

• Asynchronous mappings and asynchronous cellular automata
• scientific article; zbMATH DE number 3970130 (Why is no real title available?)
• scientific article; zbMATH DE number 4047130 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 554484 (Why is no real title available?)
• scientific article; zbMATH DE number 871239 (Why is no real title available?)
• Keeping track of the latest gossip in a distributed system
• Notes on finite asynchronous automata
• Some combinatorial aspects of time-stamp systems

Cited in

(5)

• Property-driven timestamps encoding for timeprints-based tracing and monitoring
• On the time behaviour of Okazaki fragments
• The Implementation of Mazurkiewicz Traces in POEM
• Time stamps for fixed-point approximation
• A framework for synthesis of communicating decentralised supervisors for discrete-event systems

This page was built for publication: Time-stamps for Mazurkiewicz traces.

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