You need JavaScript to view this

Automata and concurrency

Abstract

The author presents a precise notion of a realization (or simulation) of one concurrent system by another, and studies the relations of modular concurrent systems and non-persistent (i.e. With conflicts) concurrent systems in an automata theoretical style. He introduces a conception of realization that obeys three requirements: it allows for proper hierarchies in certain classes of concurrent systems; it allows for normal-form theorems, and the standard constructions of the literature remain realizations in formal concept; and it clarifies some counterintuitive examples. Further, although this realization conception is developed to translate the computational aspects of concurrent systems, it also gives a formal tool for the handling of synchronization problems. 38 references.
Authors:
Publication Date:
Jul 01, 1983
Product Type:
Journal Article
Reference Number:
EDB-85-179594
Resource Relation:
Journal Name: Theor. Comput. Sci.; (Netherlands); Journal Volume: 3
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PARALLEL PROCESSING; SIMULATION; ARRAY PROCESSORS; AUTOMATION; PROGRAMMING; 990200* - Mathematics & Computers
OSTI ID:
5081719
Research Organizations:
Univ. Paderborn, Germany
Country of Origin:
Netherlands
Language:
English
Other Identifying Numbers:
Journal ID: CODEN: TCSCD
Submitting Site:
HEDB
Size:
Pages: 221-265
Announcement Date:

Citation Formats

Priese, L. Automata and concurrency. Netherlands: N. p., 1983. Web. doi:10.1016/0304-3975(83)90113-5.
Priese, L. Automata and concurrency. Netherlands. doi:10.1016/0304-3975(83)90113-5.
Priese, L. 1983. "Automata and concurrency." Netherlands. doi:10.1016/0304-3975(83)90113-5. https://www.osti.gov/servlets/purl/10.1016/0304-3975(83)90113-5.
@misc{etde_5081719,
title = {Automata and concurrency}
author = {Priese, L}
abstractNote = {The author presents a precise notion of a realization (or simulation) of one concurrent system by another, and studies the relations of modular concurrent systems and non-persistent (i.e. With conflicts) concurrent systems in an automata theoretical style. He introduces a conception of realization that obeys three requirements: it allows for proper hierarchies in certain classes of concurrent systems; it allows for normal-form theorems, and the standard constructions of the literature remain realizations in formal concept; and it clarifies some counterintuitive examples. Further, although this realization conception is developed to translate the computational aspects of concurrent systems, it also gives a formal tool for the handling of synchronization problems. 38 references.}
doi = {10.1016/0304-3975(83)90113-5}
journal = {Theor. Comput. Sci.; (Netherlands)}
volume = {3}
journal type = {AC}
place = {Netherlands}
year = {1983}
month = {Jul}
}