Control machines: A new model of parallelism for compositional specifications and their effective compilation

DOI10.1016/S0304-3975(06)80004-6zbMath0738.68028OpenAlexW4239253156MaRDI QIDQ1177148

A. G. Heibig

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(06)80004-6

zbMATH Keywords

parallelismspecification languageparallel processeshierarchical networkmodular specifications

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of compilers and interpreters (68N20) Theory of software (68N99)

Uses Software

• CESAR
• Esterel

Cites Work

• Temporal logic programming
• Calculi for synchrony and asynchrony
• Statecharts: a visual formalism for complex systems
• Sequential and concurrent behaviour in Petri net theory
• Characterizing finite Kripke structures in propositional temporal logic
• Deadlock absence proofs for networks of communicating processes
• Synthesis of Communicating Processes from Temporal Logic Specifications
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Control machines: A new model of parallelism for compositional specifications and their effective compilation