Boolean models and planning methods for parallel abstract programs

DOI10.1134/S0005117908080146zbMath1167.68356OpenAlexW1991826421MaRDI QIDQ1003021

A. P. Novopashin, G. A. Oparin

Publication date: 26 February 2009

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117908080146

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (1)

Decomposition schemes for synthesis of scheduling strategies in scalable systems

Cites Work

• A SAT approach to query optimization in mediator systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Boolean models and planning methods for parallel abstract programs