On the relations computable by a class of concurrent automata

EW Stark - Proceedings of the 17th ACM SIGPLAN-SIGACT …, 1989 - dl.acm.org
We consider monotone input/output automata, which model a usefully large class of
dataflow networks of indeterminate (or nonfunctional) processes. We obtain a …
被引用次数：22 相关文章
[PDF] psu.edu

[PDF][PDF] On the Relations Computable by a Class of Concurrent Automata

EW Stark - Citeseer
We consider monotone input/output automata, which model a usefully large class of data ow
networks of indeterminate (or nonfunctional) processes. We obtain a characterization of the …
[PS] starkeffect.com

[PS][PS] On the Relations Computable by a Class of Concurrent Automata

EW Stark - starkeffect.com
We consider monotone input/output automata, which model a usefully large class of data ow
networks of indeterminate (or nonfunctional) processes. We obtain a characterization of the …
[PS] stonybrook.edu

[PS][PS] On the Relations Computable by a Class of Concurrent Automata

EW Stark - bsd7.cs.stonybrook.edu
We consider monotone input/output automata, which model a usefully large class of data ow
networks of indeterminate (or nonfunctional) processes. We obtain a characterization of the …