"The complexity of the temporal logic with "until" over general linear time."

Mark Reynolds (2003)

> Home

Details and statistics

DOI: 10.1016/S0022-0000(03)00005-9

access: open

type: Journal Article

metadata version: 2021-07-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/Reynolds03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/Reynolds03
Mark Reynolds:
The complexity of the temporal logic with "until" over general linear time. J. Comput. Syst. Sci. 66(2): 393-426 (2003)

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.