Stable trace automata vs. full trace automata

DOI10.1016/S0304-3975(97)00299-5zbMATH Open0963.68097MaRDI QIDQ1276249FDOQ1276249

Authors: Vincent Schmitt 

Publication date: 20 January 1999

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

Recommendations

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

zbMATH Keywords

finite full trace automatatrace automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Petri nets, event structures and domains. I
• Concurrent Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Event structures and trace monoids
• Finite labelling problem in event structures
• Event structures and domains
• Labelled domains and automata with concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Connections between a concrete and an abstract model of concurrent systems
• Title not available (Why is that?)
• Context-free event domains are recognizable

Cited In (2)

• Context-free event domains are recognizable
• Title not available (Why is that?)

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)