The Implementation of Mazurkiewicz Traces in POEM

DOI10.1007/11901914_37zbMATH Open1161.68579OpenAlexW1490551994MaRDI QIDQ3522932FDOQ3522932

Authors: Peter Niebert, Hongyang Qu 

Publication date: 4 September 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11901914_37

Recommendations

• scientific article; zbMATH DE number 177513
• Time-stamps for Mazurkiewicz traces.
• scientific article; zbMATH DE number 177254
• Theory of traces
• Trade-offs in true concurrency: Pomsets and mazurkiewicz traces

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

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

Uses Software

• IF-2.0

This page was built for publication: The Implementation of Mazurkiewicz Traces in POEM

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