"An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness ..."

Peter Kemper, Falko Bause (1992)

> Home

Details and statistics

DOI: 10.1007/3-540-55676-1_15

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/apn/KemperB92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/apn/KemperB92
Peter Kemper, Falko Bause:
An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets. Application and Theory of Petri Nets 1992: 263-278

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.