1988
DOI: 10.1007/bf02737096
|View full text |Cite
|
Sign up to set email alerts
|

Fifo nets without order deadlock

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1998
1998
1998
1998

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…Systems of CSFMs pose strict constraints on design, since they adopt the ®fo channel as a built-in communication mechanism. First In First Out Nets (FIFO nets) (Finkel and Choquet, 1988;Finkel and Rosier, 1988) have been proposed as a generalization of both PNs and systems CSFMs. Places and tokens in a FIFO net represent ®fo queues and letters, respectively.…”
Section: Extensions Based On Systems Of Communicating ®Nite State Macmentioning
confidence: 99%
“…Systems of CSFMs pose strict constraints on design, since they adopt the ®fo channel as a built-in communication mechanism. First In First Out Nets (FIFO nets) (Finkel and Choquet, 1988;Finkel and Rosier, 1988) have been proposed as a generalization of both PNs and systems CSFMs. Places and tokens in a FIFO net represent ®fo queues and letters, respectively.…”
Section: Extensions Based On Systems Of Communicating ®Nite State Macmentioning
confidence: 99%