Control machines: A new model of parallelism for compositional specifications and their effective compilation
type: Item
instance of: scholarly article
title: Control machines: A new model of parallelism for compositional specifications and their effective compilation
zbMATH Open document ID: 0738.68028
DOI: 10.1016/S0304-3975(06)80004-6
author: A. G. Heibig
published in: Theoretical Computer Science
publication date: 1992-06-26T00:00:00Z
review text: The author presents a model of parallelism and a specification language which allow modular (compositional) specifications of parallel processes. He also gives an algorithm which compiles the main part of this specification language and requires only linear time and space. The model exhibits a strong connection between temporal logic operations and regular operations on processes. The model and the specification language have been designated for real-time applications although the basic ideas are more general.
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 20008
zbMATH Keywords: hierarchical network
zbMATH Keywords: parallelism
zbMATH Keywords: specification language
zbMATH Keywords: modular specifications
zbMATH Keywords: parallel processes
reviewed by: Satoshi Miura
describes a project that uses: CESAR
describes a project that uses: Esterel
MaRDI profile type: Publication
cites work: Temporal logic programming
cites work: Q3030242
cites work: Q3735065
cites work: Characterizing finite Kripke structures in propositional temporal logic
cites work: Sequential and concurrent behaviour in Petri net theory
cites work: Q3336675
cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications
cites work: Q3687696
cites work: Q4722045
cites work: Q4723291
cites work: Q4723289
cites work: Statecharts: a visual formalism for complex systems
cites work: Q3907039
cites work: Q3680261
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: Q3711745
cites work: Q3750114
cites work: Calculi for synchrony and asynchrony
cites work: Q3832059
cites work: Deadlock absence proofs for networks of communicating processes
cites work: Synthesis of Communicating Processes from Temporal Logic Specifications
cites work: Q3745263
cites work: Q3940830
cites work: Q3779734
cites work: Q3678655
cites work: Q3667958
full work available at URL: s0304-3975(06)80004-6
OpenAlex ID: W4239253156
description: scientific article; zbMATH DE number 20008