Stable trace automata vs. full trace automata

DOI10.1016/S0304-3975(97)00299-5zbMath0963.68097MaRDI QIDQ1276249

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Event structures and domains
• Petri nets, event structures and domains. I
• Event structures and trace monoids
• Finite labelling problem in event structures
• Labelled domains and automata with concurrency
• Concurrent Machines
• Context-free event domains are recognizable
• Connections between a concrete and an abstract model of concurrent systems

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