On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic
The model-checking problem for Resource Agent Logic is known to be undecidable. We review existing (un)decidability results and identify a significant fragment of the logic for which model checking is decidable. We discuss aspects which makes model checking decidable and prove undecidability of two...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2015
|
| Online Access: | https://eprints.nottingham.ac.uk/30178/ |