Fifo nets without order deadlock
type: Item
instance of: scholarly article
title: Fifo nets without order deadlock
zbMATH Open document ID: 0614.68050
DOI: 10.1007/BF00268843
author: Alain Finkel
author: Annie Choquet
published in: Acta Informatica
publication date: 1988-01-01T00:00:00Z
review text: We introduce a generalization of free choice nets to fifo. These fifo nets are free from deadlocks caused by the order of messages in fifo queues. We describe some tools for their analysis, using the facts that they are weakly monotonous, and that there is a close relation between their languages and those of the associated coloured nets. Therefore, quasi-liveness, finite termination and liveness are decidable properties.
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 3995068
zbMATH Keywords: free choice nets
zbMATH Keywords: fifo nets
zbMATH Keywords: fifo queues
zbMATH Keywords: quasi-liveness
zbMATH Keywords: finite termination
MaRDI profile type: Publication
cites work: Q4430283
cites work: Q3675512
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Reachability trees for high-level Petri nets
cites work: An Algorithm for the General Petri Net Reachability Problem
cites work: An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
cites work: Automates a file
full work available at URL: https://doi.org/10.1007/bf00268843
OpenAlex ID: W1998467885
description: scientific article; zbMATH DE number 3995068