Parallel program schemata
Reads0
Chats0
TLDR
This paper introduces a model called the parallel program schema for the representation and study of programs containing parallel sequencing, related to Ianov's program schema, but extends it, both by modelling memory structure in more detail and by admitting parallel computation.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1969-05-01 and is currently open access. It has received 1040 citations till now. The article focuses on the topics: Schema (psychology).read more
Citations
More filters
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Journal ArticleDOI
Synchronous data flow
TL;DR: A preliminary SDF software system for automatically generating assembly language code for DSP microcomputers is described, and two new efficiency techniques are introduced, static buffering and an extension to SDF to efficiently implement conditionals.
Journal ArticleDOI
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
TL;DR: This self-contained paper develops the theory necessary to statically schedule SDF programs on single or multiple processors, and a class of static (compile time) scheduling algorithms is proven valid, and specific algorithms are given for scheduling SDF systems onto single ormultiple processors.
Journal ArticleDOI
Petri Nets
TL;DR: The structure of Petr i nets, thei r markings and execution, several examples of Petm net models of computer hardware and software, and research into the analysis of Pet m nets are presented, as are the use of the reachabil i ty tree and the decidability and complexity of some Petr i net problems.
Journal ArticleDOI
Modeling and verification of time dependent systems using time Petri nets
Bernard Berthomieu,Michel Diaz +1 more
TL;DR: An enumerative method is proposed in order to exhaustively validate the behavior of Merlin's time Petri net model and it is applied to the specification and verification of the alternating bit protocol as a simple illustrative example.
References
More filters
Kommunikation mit Automaten
TL;DR: The theory of automata is shown not capable of representing the actual physical flow of information in the solution of a recursive problem and a theory of communication is proposed that yields a means of representation that with equal rigor and simplicity accomplishes more than the theory of synchronous automata.
Journal ArticleDOI
Finite automata and their decision problems
Michael O. Rabin,Dana Scott +1 more
TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Journal ArticleDOI
The Organization of Computations for Uniform Recurrence Equations
TL;DR: In this paper, a dependence graph G having m vertices, in which the directed edges are labeled with integer n-vectors, is defined and necessary and sufficient conditions on G are given for the existence of a schedule to compute all the quantities ai(p) explicitly from their defining equations.