| |
Browse All Reviews > Theory Of Computation (F) > Logics And Meanings Of Programs (F.3) > Studies Of Program Constructs (F.3.3) > Control Primitives (F.3.3...)
|
|
 |
|
|
| |
|
|
| |
1-9 of 9
Reviews about "Control Primitives (F.3.3...)":
|
Date Reviewed |
| |
Partial interconnection and observer-based dead-beat control of two-dimensional behaviors
Bisiacco M., Valcher M. Multidimensional Systems and Signal Processing 26(2): 459-479, 2015. Type: Article
The zero-time-controllability of an observer-based deadbeat controller (DBC) is described in this paper. Deadbeat control is a typical example of linear control strategies in discrete-time systems. The standard objective of deadbeat co...
|
May 18 2016 |
| |
A relation algebraic model of robust correctness
Gritzner T., Berghammer R. Theoretical Computer Science 159(2): 245-270, 1996. Type: Article
A number of relational semantics of sequential program constructs have been proposed over the years. This one concentrates on demonic nondeterminism. The work is lattice-theoretic and recursion is treated, but assignment statements are...
|
May 1 1997 |
| |
Iteration theories
Bloom S., Ésik Z., Springer-Verlag New York, Inc., New York, NY, 1993. Type: Book (9780387563787)
This monograph contains the results of our joint research over the last ten years.…This book provides a detailed investigation of the properties of the fixed point or iteration operation.…It is shown that i...
|
May 1 1995 |
| |
Reducibility of synchronization structures
Ginzburg A., Yoeli M. Theoretical Computer Science 40(2-3): 301-314, 1985. Type: Article
A form of control flow analysis is applied to concurrent programs containing fork and join operations. A program is viewed as a Petri net with multiple tokens that imposes a partial ordering on events. The directed acyclic graph repres...
|
May 1 1987 |
| |
On simple programs with primitive conditional statements
Ibarra O., Rosier L. Information and Control 65(1): 42-62, 1985. Type: Article
This paper contributes many technical results to the study of semantics for programs with varying complexity. Let L and L′ be two classes of programs, and let C and C ′ be the correspondi...
|
Aug 1 1986 |
| |
Procedural operators considered as fundamental programming devices
Symes D. Information Systems 10(2): 75-89, 1985. Type: Article
This paper presents an intriguing and very different notion of what, perhaps, a programming language should be like. This is as opposed to our traditional languages, whose essential natures are very much the consequences of seri...
|
Mar 1 1986 |
| |
More on looping vs. repeating in dynamic logic
Harel D., Peleg D. Information Processing Letters 20(2): 87-90, 1985. Type: Article
In this short paper, the authors deal with the relative power of the formulas loop ( &agr; ) and repeat ( &agr; ) in the framework of the first-order dynamic logic. A formula loop ( &agr; ) expresses th...
|
Feb 1 1986 |
| |
A generalised mathematical theory of structured programming
Fenton N., Whitty R., Kaposi A. Theoretical Computer Science 36(2-3): 145-171, 1985. Type: Article
Using the single operation of flowchart composition, classes of flowchart schemes are generated from arbitrary sets of graphs representing basic control structures. Starting from the appropriate initial structures then yields the conve...
|
Feb 1 1986 |
| |
An application of Cohen’s result on star height to the theory of control structures
Motoki T. Journal of Computer and System Sciences 29(3): 312-329, 1984. Type: Article
An uninitiated reader who wishes to use this paper for insight into the correspondence between program graphs and automata might first consult the chapter on star height in the book by Salomaa [1]. It would also be useful to review the...
|
Oct 1 1985 |
| |
|
|
| |
|
|
