A Robust Theory of Series Parallel Graphs

Motivated by distributed data processing applications, we introduce a class of labeled directed acyclic graphs constructed using sequential and parallel composition operations, and study automata and logics over them. We show that deterministic and non-deterministic acceptors over such graphs have t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages Jg. 7; H. POPL; S. 1058 - 1088
Hauptverfasser:	Alur, Rajeev, Stanford, Caleb, Watson, Christopher
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 09.01.2023
Schlagworte:	Data streaming Formal languages and automata theory Information systems Theory of computation regular languages logic in computer science series-parallel graphs distributed stream processing
ISSN:	2475-1421, 2475-1421
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!