| |
Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Mathematical Logic (F.4.1) > Temporal Logic (F.4.1...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 12
Reviews about "Temporal Logic (F.4.1...)":
|
Date Reviewed |
| |
Symbolic checking of fuzzy CTL on fuzzy program graph
Ebrahimi M., Sotudeh G., Movaghar A. Acta Informatica 56(1): 1-33, 2019. Type: Article
This paper presents a new temporal logic for fuzzy logic systems, fuzzy computation tree logic (FzCTL), based on previous work on Kripke structures for fuzzy logic systems, that is, fuzzy program graph (FzPG) [1]. The motivation for pr...
|
Mar 20 2019 |
| |
Safe autonomy under perception uncertainty using chance-constrained temporal logic
Jha S., Raman V., Sadigh D., Seshia S. Journal of Automated Reasoning 60(1): 43-62, 2018. Type: Article
The topic of self-driving cars is receiving a lot of press lately. This paper on safe autonomy is an interesting read for people researching autonomous vehicles or more generally autonomous control systems. While the authors provide re...
|
Jan 17 2019 |
| |
Metric temporal logic revisited
Reynolds M. Acta Informatica 53(3): 301-324, 2016. Type: Article
The extension of temporal logic to measuring time durations is the basis of the theory of timed and hybrid automata, leading to the verification of metric temporal properties. Alur et al. (reference [1] in the paper), and more recently...
|
Jun 3 2016 |
| |
Systematic versus non systematic techniques for solving temporal constraints in a dynamic environment
Mouhoub M. AI Communications 17(4): 201-211, 2004. Type: Article
Artificial Intelligence has matured to the point that it is proving useful in many real-world applications. Planning and scheduling in dynamic environments is one such domain. Imagine a robot navigating through a university full of stu...
|
Jan 12 2006 |
| |
Static analysis for state-space reductions preserving temporal logics
Yorav K., Grumberg O. Formal Methods in System Design 25(1): 67-96, 2004. Type: Article
The problem of automatic verification of programs is a grave one, even for “small” programs, since their semantic models grow not only with the size of the program, but also with the number of variables and ...
|
Aug 3 2005 |
| |
 Duration calculus: a formal approach to real-time systems
Zhou C., Hansen M., Springer-Verlag, London, UK, 2004. 247 pp. Type: Book (9783540408239)
The basic concepts of mathematical logic, starting from Boolean algebra and sentential logic, to first-order logic and Gödel’s incompleteness theorem, were discovered in the 19th and early 20th centuries, as a conseq...
|
Sep 21 2004 |
| |
An expressively complete linear time temporal logic for Mazurkiewicz traces: an experiment with the shortest-paths algorithms
Thiagarajan P., Walukiewicz I. Information and Computation 179(2): 230-249, 2002. Type: Article
The basic result, due to Kamp, concerning the propositional temporal logic of linear time (LTL) interpreted over sequences is that LTL has the same expressive power as the first order theory of sequences. Unfortunately, using sequences...
|
Jul 10 2003 |
| |
LTL is expressively complete for Mazurkiewicz traces
Diekert V., Gastin P. Journal of Computer and System Sciences 64(2): 396-418, 2002. Type: Article
When dealing with concurrent systems, one possible approach is to reduce them to sequential systems, by considering all linearizations. Then, one can apply techniques and tools developed for sequential systems. Using this approach, how...
|
Jun 23 2003 |
| |
The complexity of propositional linear temporal logics in simple cases
Demri S., Schnoebelen P. Information and Computation 174(1): 84-103, 2002. Type: Article
Propositional linear temporal logic (PLTL) is the basic logical tool that is utilized for the specification and verification of reactive systems. The main syntactic feature of PLTL is that it uses the temporal operators X
|
Jan 8 2003 |
| |
Clausal temporal resolution
Fisher M., Dixon C., Peim M. ACM Transactions on Computational Logic 2(1): 12-56, 2001. Type: Article
A clausal resolution method for propositional linear temporal logic is presented. The method, originally proposed by Fisher in 1991 [1], is clausal. It works on formulas transformed to a normal form called separated normal form (SNF), ...
|
Aug 1 2001 |
| |
|
|
| |
|
|
