.png){kind=icon}
.png){kind=icon}
Return
Binders for Switch Graphs Specification
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-031-94748-3_4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Switch graphs, as proposed by Marcelino and Gabbay are relation-changing state transition structures which make use of higher-level directed edges (edges connecting edges) to represent how the accessibility relation changes. In previous work, the same authors propose an hybrid logic to describe such systems. In this work we consider a variant of hybrid logic that excludes nominals and considers state-variables, and we explore how this logic can be used to describe these structures, in particular, higher-level edges. Afterwards, we define two classes of behavioural equivalence and discuss their utility and limitation with some examples.
Keywords:
Relation-changing
Switch graph
Binding operator
Journal
S
IF:
0
Papers:
20
Citations:
0