2009
DOI: 10.1007/978-3-642-04420-5_11
|View full text |Cite
|
Sign up to set email alerts
|

Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2009
2009
2011
2011

Publication Types

Select...
1
1
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…In [9] we devised a computable semantics for CT L on discrete-time continuousspace dynamic systems (DTCSDSs). Employing path spaces, in [10] this semantics was extended to a computable semantics of CT L * .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In [9] we devised a computable semantics for CT L on discrete-time continuousspace dynamic systems (DTCSDSs). Employing path spaces, in [10] this semantics was extended to a computable semantics of CT L * .…”
Section: Introductionmentioning
confidence: 99%
“…Employing path spaces, in [10] this semantics was extended to a computable semantics of CT L * . Our motivation was based on the fact that CT L * is a strict super set of LT L and CT L, i. e. it allows for a wider range of reachability properties by combining linear-and branching-time semantics.…”
Section: Introductionmentioning
confidence: 99%