Data optimizations for constraint automata

DOI10.2168/LMCS-12(3:11)2016zbMath1398.68312arXiv1608.04592OpenAlexW3106374809MaRDI QIDQ2974782

Farhad Arbab, Sung-Shik Jongmans

Publication date: 11 April 2017

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.04592

zbMATH Keywords

performanceoptimizationcompilationprotocolsReoconstraint automata

Mathematics Subject Classification ID

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

Uses Software

• Reo
• NAS Parallel Benchmarks

Cites Work

• Combine and conquer: relating BIP and Reo
• Synthesis of Reo circuits from scenario-based interaction specifications
• The complexity of finding arborescences in hypergraphs
• Abstract behavior types: a foundation model for components and their composition
• Directed hypergraphs and applications
• On forward checking for non-binary constraint satisfaction.
• Modeling component connectors in Reo by constraint automata
• Topological sorting of large networks
• Reo: a channel-based coordination model for component composition
• An axiomatic basis for computer programming
• Causal semantics for the algebra of connectors
• Unnamed Item
• Unnamed Item

This page was built for publication: Data optimizations for constraint automata