Model Checking Linear Temporal Logic with Standpoint Modalities
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915175755415552 |
|---|---|
| author | Aghamov, Rajab Baier, Christel Karimov, Toghrul Majumdar, Rupak Ouaknine, Joël Piribauer, Jakob Spork, Timm |
| author_facet | Aghamov, Rajab Baier, Christel Karimov, Toghrul Majumdar, Rupak Ouaknine, Joël Piribauer, Jakob Spork, Timm |
| contents | Standpoint linear temporal logic ($SLTL$) is a recently introduced extension of classical linear temporal logic ($LTL$) with standpoint modalities. Intuitively, these modalities allow to express that, from agent $a$'s standpoint, it is conceivable that a given formula holds.
Besides the standard interpretation of the standpoint modalities we introduce four new semantics, which differ in the information an agent can extract from the history. We provide a general model checking algorithm applicable to $SLTL$ under any of the five semantics. Furthermore we analyze the computational complexity of the corresponding model checking problems, obtaining PSPACE-completeness in three cases, which stands in contrast to the known EXPSPACE-completeness of the $SLTL$ satisfiability problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_20193 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Model Checking Linear Temporal Logic with Standpoint Modalities Aghamov, Rajab Baier, Christel Karimov, Toghrul Majumdar, Rupak Ouaknine, Joël Piribauer, Jakob Spork, Timm Logic in Computer Science Standpoint linear temporal logic ($SLTL$) is a recently introduced extension of classical linear temporal logic ($LTL$) with standpoint modalities. Intuitively, these modalities allow to express that, from agent $a$'s standpoint, it is conceivable that a given formula holds. Besides the standard interpretation of the standpoint modalities we introduce four new semantics, which differ in the information an agent can extract from the history. We provide a general model checking algorithm applicable to $SLTL$ under any of the five semantics. Furthermore we analyze the computational complexity of the corresponding model checking problems, obtaining PSPACE-completeness in three cases, which stands in contrast to the known EXPSPACE-completeness of the $SLTL$ satisfiability problem. |
| title | Model Checking Linear Temporal Logic with Standpoint Modalities |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2502.20193 |