"The Complexity of Satisfiability for Fragments of CTL and CTL*."

Arne Meier et al. (2009)

> Home

Details and statistics

DOI: 10.1142/S0129054109006954

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/MeierTVM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/MeierTVM09
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk:
The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. 20(5): 901-918 (2009)

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.