"Faster algorithms for quantitative verification in bounded treewidth graphs."

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis (2021)

> Home

Details and statistics

DOI: 10.1007/S10703-021-00373-5

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fmsd/ChatterjeeIP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fmsd/ChatterjeeIP21
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods Syst. Des. 57(3): 401-428 (2021)

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.