Reachability in cyclic extended free-choice systems
type: Item
instance of: scholarly article
title: Reachability in cyclic extended free-choice systems
zbMATH Open document ID: 0778.68068
DOI: 10.1016/0304-3975(93)90154-L
author: Jörg Desel
author: Javier Esparza
published in: Theoretical Computer Science
publication date: 1993-10-25T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 417350
zbMATH Keywords: Petri nets
zbMATH Keywords: liveness
zbMATH Keywords: boundedness
zbMATH Keywords: cyclicity
MaRDI profile type: Publication
cites work: Partial order behaviour and structure of Petri nets
cites work: Traps characterize home states in free choice systems
cites work: Marked directed graphs
cites work: Q4035686
cites work: Synchronisationsgraphen
cites work: An Algorithm for the General Petri Net Reachability Problem
full work available at URL: 0304-3975(93)90154-l
OpenAlex ID: W2071268441
description: scientific article; zbMATH DE number 417350