On the structure of recognizable languages of dependence graphs

DOI10.1051/ita/1993270100071zbMath0787.68060OpenAlexW165983MaRDI QIDQ5286052

Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg

Publication date: 29 June 1993

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

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

zbMATH Keywords

behaviourdependence graphconcurrent systemtheory of tracessafe Petri netRecDG language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Traces, dependency graphs and DNLC grammars
• Theory of traces
• Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
• Combinatorial problems of commutation and rearrangements
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Trace languages defined by regular string languages

This page was built for publication: On the structure of recognizable languages of dependence graphs