"On the Complexity of Termination Inference for Processes."

Romain Demangeon et al. (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-78663-4_11

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tgc/DemangeonHKS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tgc/DemangeonHKS07
Romain Demangeon, Daniel Hirschkoff, Naoki Kobayashi, Davide Sangiorgi:
On the Complexity of Termination Inference for Processes. TGC 2007: 140-155

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.