An extension of the notions of traces and of asynchronous automata

DOI10.1051/ita/1991250403551zbMath0765.68153OpenAlexW50830508MaRDI QIDQ3988805

André Arnold

Publication date: 28 June 1992

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92397

zbMATH Keywords

traceZielonka's theoremCCI-sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

Asynchronous automata versus asynchronous cellular automata ⋮ Regular sets of infinite message sequence charts ⋮ A partial trace semantics for Petri nets ⋮ Probabilistic asynchronous automata ⋮ MSO Logic for Unambiguous Shared-Memory Systems ⋮ Semantics of Deterministic Shared-Memory Systems ⋮ On the join dependency relation in multinomial lattices ⋮ Shared-Memory Systems and Charts ⋮ UNAMBIGUOUS SHARED-MEMORY SYSTEMS ⋮ Topological Properties of Event Structures ⋮ Pomset Languages of Finite Step Transition Systems ⋮ Asynchronous cellular automata for pomsets

Cites Work

• Behaviours of concurrent systems
• Petri nets, event structures and domains. I
• An algebraic description of system behaviours
• The non-sequential behaviour of Petri nets
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
• Notes on finite asynchronous automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An extension of the notions of traces and of asynchronous automata