1966
DOI: 10.21236/ad0630125
|View full text |Cite
|
Sign up to set email alerts
|

COMMUNICATION WITH AUTOMATA: Volume 1 Supplement 1

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
100
0
7

Year Published

1975
1975
2019
2019

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 105 publications
(107 citation statements)
references
References 6 publications
0
100
0
7
Order By: Relevance
“…The first relates to the difficulty of estimating the optimal number of workers in our system to efficiently run. While the worker allocation is still largely done using a trial and error approach, we are investigating more sophisticated approaches based on formal models of distributed computation, such as Petri Nets [30].…”
Section: Discussionmentioning
confidence: 99%
“…The first relates to the difficulty of estimating the optimal number of workers in our system to efficiently run. While the worker allocation is still largely done using a trial and error approach, we are investigating more sophisticated approaches based on formal models of distributed computation, such as Petri Nets [30].…”
Section: Discussionmentioning
confidence: 99%
“…Petri nets (see e.g. Petri [1966] or Petri [1996]) or using Max-Plus systems (see e.g. Heidergott [2006] or de Schutter [2001).…”
Section: Problem Formulationmentioning
confidence: 99%
“…Inherently, the basic components of a Petri net, the concepts of marking and firing. Petri nets (PNs) introduced by C. A. Petri [27] were originally intended as a means for the representation of the interaction, logical sequence and synchronization among activities which are only of a logical nature [26]. A PN is a directed bipartite graph which comprises a set of places P, a set of transitions T, and a set of directed arcs defined by input and output incidence application (Pre and Post).…”
Section: From Pn To Spnmentioning
confidence: 99%