"On the computational complexity of the verification of modular ..."

Kurt Rohloff, Stéphane Lafortune (2002)

> Home

Details and statistics

DOI: 10.1109/CDC.2002.1184460

access: closed

type: Conference or Workshop Paper

metadata version: 2022-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cdc/RohloffL02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cdc/RohloffL02
Kurt Rohloff, Stéphane Lafortune:
On the computational complexity of the verification of modular discrete-event systems. CDC 2002: 16-21

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.