Stable trace automata vs. full trace automata

DOI10.1016/S0304-3975(97)00299-5MaRDI QIDQ1276249zbMATH OpenFDO

Authors Vincent Schmitt

Publication date 20 January 1999

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

zbMATH Keywords

finite full trace automatatrace automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 177814
• CONCURRENT AUTOMATA AND DOMAINS
• Publication:4508302

Cites work

• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 4048997 (Why is no real title available?)
• scientific article; zbMATH DE number 177814 (Why is no real title available?)
• scientific article; zbMATH DE number 849039 (Why is no real title available?)
• scientific article; zbMATH DE number 1456962 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Concurrent Machines
• Connections between a concrete and an abstract model of concurrent systems
• Context-free event domains are recognizable
• Event structures and domains
• Event structures and trace monoids
• Finite labelling problem in event structures
• Labelled domains and automata with concurrency
• Petri nets, event structures and domains. I

Cited in

(2)

• Context-free event domains are recognizable
• scientific article; zbMATH DE number 4155919 (Why is no real title available?)

This page was built for publication: Stable trace automata vs. full trace automata

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