"Complexity of Compositional Model Checking of Computation Tree Logic on ..."

Krishnendu Chatterjee, Pallab Dasgupta, P. P. Chakrabarti (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-30536-1_13

access: closed

type: Conference or Workshop Paper

metadata version: 2022-11-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwdc/ChatterjeeDC04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwdc/ChatterjeeDC04
Krishnendu Chatterjee, Pallab Dasgupta, P. P. Chakrabarti:
Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures. IWDC 2004: 102-113

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.