The Expressive Power, Satisfiability and Path Checking Problems of MTL and TPTL over Non-Monotonic Data Words

The Expressive Power, Satisfiability and Path Checking Problems of MTL and TPTL over Non-Monotonic Data Words

Recently, verification and analysis of data words have gained a lot of interest. Metric temporal logic (MTL) and timed propositional temporal logic (TPTL) are two extensions of Linear time temporal logic (LTL). In MTL, the temporal operator are indexed by a constraint interval. TPTL is a more powerf...

Full description

Bibliographic Details
Main Author: Feng, Shiguang
Other Authors: Universität Leipzig, Fakultät für Mathematik und Informatik
Format: Doctoral Thesis
Language:English
Published: Universitätsbibliothek Leipzig 2016
Subjects:
Temporale Logik
Erfüllbarkeit
Ausdruckskraft
Komplexität
temporal logic
satisfiability
expressive power
path checking
complexity
counter machine
ddc:500
Online Access:http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208823
http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208823
http://www.qucosa.de/fileadmin/data/qucosa/documents/20882/Thesis_Feng.pdf

Internet

http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208823
http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208823
http://www.qucosa.de/fileadmin/data/qucosa/documents/20882/Thesis_Feng.pdf

Similar Items