1989
DOI: 10.1007/bfb0013022
|View full text |Cite
|
Sign up to set email alerts
|

Branching time temporal logic

Abstract: This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks, which are typically seen in robotics and control applications. This paper also discusses the relaxation of TWTL formulae with respect to deadlines of tasks. Efficient automata-based frameworks to solve synthesis, verification and learning problems are also presented. The key in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

1990
1990
2017
2017

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 78 publications
(27 citation statements)
references
References 61 publications
0
26
0
Order By: Relevance
“…[Lam83]. Actually, very interesting logics like CTL and CTL *interpreted over KS's have been put forward [EH83, ES89] and have been thoroughly investigated [BCG88]; also, sophisticated and efficient tools have been developed for them [CES86]. For LTS 's, on the other hand, Hennessy an Milner which were more interested in properly describing the actual behaviour of communicating systems, did define a new logic, now known as HML [HM85].…”
Section: Introductionmentioning
confidence: 99%
“…[Lam83]. Actually, very interesting logics like CTL and CTL *interpreted over KS's have been put forward [EH83, ES89] and have been thoroughly investigated [BCG88]; also, sophisticated and efficient tools have been developed for them [CES86]. For LTS 's, on the other hand, Hennessy an Milner which were more interested in properly describing the actual behaviour of communicating systems, did define a new logic, now known as HML [HM85].…”
Section: Introductionmentioning
confidence: 99%
“…Usually, only infinite paths are considered, whereas we also look at prefixes of such infinite paths. The interpretation we give below has, however, also been considered by [6] and [4]. …”
Section: Definition 3 the Set Of Ctl Formulas Over Ap Is Defined As mentioning
confidence: 86%
“…For most applications, this speculation of customary Colored Petri Nets permits the client to make more sensible depictions, because of the way that equivalent sub Nets can be collapsed into one another, yielding a much littler Net. For reasons unknown spot invariants and achieve capacity trees, noteworthy techniques for standard CPNs, can be summed up to pertain for Colored Petri Nets [18].Colored Petri Nets and Predicate/transition-Nets are very intently linked, in the way that Colored Petri Nets have been established as an alteration of Predicate/transition-Nets, in order to avoid some practical troubles which rise when the technique of place-invariants is general to apply for Predicate [18].Colored Petri Net concept delivers potent analysis techniques used to verify the accuracy of workflow procedures. Acceptance of a model-driven approach, joined through comprehensive verification methods can make available a key solution for making qualitative and quantitative calculations about the possible system behaviors [18,19].…”
Section: Model Checkingmentioning
confidence: 99%