"How Hard Is Finding Shortest Counter-Example Lassos in Model Checking?"

Rüdiger Ehlers (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-30942-8_16

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fm/Ehlers19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fm/Ehlers19
Rüdiger Ehlers:
How Hard Is Finding Shortest Counter-Example Lassos in Model Checking? FM 2019: 245-261

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.