Stable trace automata vs. full trace automata
type: Item
instance of: scholarly article
title: Stable trace automata vs. full trace automata
zbMATH Open document ID: 0963.68097
DOI: 10.1016/S0304-3975(97)00299-5
author: Vincent Schmitt
published in: Theoretical Computer Science
publication date: 1999-01-20T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1243213
zbMATH Keywords: trace automata
zbMATH Keywords: finite full trace automata
MaRDI profile type: Publication
cites work: Finite labelling problem in event structures
cites work: Context-free event domains are recognizable
cites work: Q5615282
cites work: Labelled domains and automata with concurrency
cites work: Q3785893
cites work: Event structures and domains
cites work: Q4038692
cites work: Q4867292
cites work: Q4954451
cites work: Q3771629
cites work: Petri nets, event structures and domains. I
cites work: Event structures and trace monoids
cites work: Concurrent Machines
cites work: Connections between a concrete and an abstract model of concurrent systems
description: scientific article; zbMATH DE number 1243213