2020
DOI: 10.1007/978-3-030-63595-4_9
|View full text |Cite
|
Sign up to set email alerts
|

Strategies, Model Checking and Branching-Time Properties in Maude

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(19 citation statements)
references
References 27 publications
0
19
0
Order By: Relevance
“…Looking at a strategy as a subset E ⊆ S * ∪ S ω of allowed executions of a model K, the satisfaction of a linear-time property (K, E) ⊨ φ can be understood as its satisfaction K, π ⊨ φ for all allowed executions π ∈ E. The question of which are the executions described by a Maude strategy language expression is given answer by a small-step operational semantics, which is respected by the model-checker implementations. This can be easily extrapolated to branching-time properties [31], whose allowed executions can be seen as a restricted execution tree. CTL, CTL*, and µ-calculus properties can be checked using external model checkers through an extensible interface umaudemc that unifies the interaction and the syntax of the logics [28].…”
Section: Model Checkingmentioning
confidence: 99%
See 4 more Smart Citations
“…Looking at a strategy as a subset E ⊆ S * ∪ S ω of allowed executions of a model K, the satisfaction of a linear-time property (K, E) ⊨ φ can be understood as its satisfaction K, π ⊨ φ for all allowed executions π ∈ E. The question of which are the executions described by a Maude strategy language expression is given answer by a small-step operational semantics, which is respected by the model-checker implementations. This can be easily extrapolated to branching-time properties [31], whose allowed executions can be seen as a restricted execution tree. CTL, CTL*, and µ-calculus properties can be checked using external model checkers through an extensible interface umaudemc that unifies the interaction and the syntax of the logics [28].…”
Section: Model Checkingmentioning
confidence: 99%
“…This can be easily extrapolated to branching-time properties [31], whose allowed executions can be seen as a restricted execution tree. CTL, CTL*, and µ-calculus properties can be checked using external model checkers through an extensible interface umaudemc that unifies the interaction and the syntax of the logics [28]. This interface is built over a library that allows accessing Maude objects and operations from Python and other programming languages, which can be used to make these model checkers directly available to Maude-based frameworks like the one for membrane systems presented here.…”
Section: Model Checkingmentioning
confidence: 99%
See 3 more Smart Citations