Asynchronous automata-theoretic characterization of aperiodic trace languages

DOI10.1007/978-3-540-30538-5_8MaRDI QIDQ5465887zbMATH OpenOpenAlexFDO

Authors Bharat Adsul, Milind Sohoni

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Distributed Asynchronous Automata
• scientific article; zbMATH DE number 17820
• Deterministic asynchronous automata for infinite traces
• scientific article; zbMATH DE number 1015097
• Probabilistic asynchronous automata

Cited in

(10)

• Deterministic asynchronous automata for infinite traces
• Aperiodic languages in concurrency monoids
• An Automata-Theoretical Characterization of Context-Free Trace Languages
• scientific article; zbMATH DE number 17820 (Why is no real title available?)
• On aperiodic trace languages
• scientific article; zbMATH DE number 3497800 (Why is no real title available?)
• scientific article; zbMATH DE number 7559475 (Why is no real title available?)
• Asynchronous wreath product and cascade decompositions for concurrent behaviours
• An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications
• Characterizations of fragments of temporal logic over Mazurkiewicz traces

This page was built for publication: Asynchronous automata-theoretic characterization of aperiodic trace languages

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