Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ICALP
1998
Springer

favoriteEmaildiscussreport

106views Programming Languages» more ICALP 1998»

Difficult Configurations - On the Complexity of LTrL

13 years 8 months ago

Difficult Configurations - On the Complexity of LTrL

Download www.labri.fr

The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also called configuration. The logic is shown to be non-elementary with the main reason for this complexity being the nesting of until operators in formulas. The fragment of the logic without the until operator is shown to be EXPSPACE-hard.

Igor Walukiewicz

Real-time Traffic

Global | Global State | ICALP 1998 | Programming Languages | Time Temporal Logic |

claim paper

Related Content

» Covering arrays for efficient fault characterization in complex configuration spaces

» RealTime Projector Tracking on Complex Geometry Using Ordinary Imagery

» Acceleration of FPGA Fault Injection Through MultiBit Testing

» A smart hillclimbing algorithm for application server configuration

» An OntologyBased Approach to Supporting Didactics in ELearning Systems

» A combination of particle filtering and deterministic approaches for multiple kernel track...

» A Mobile Agent Approach to ProcessBased Dynamic Adaptation of Complex Software Systems

» Security Analysis and Configuration of Large Networks

» Practical verification techniques for widearea routing

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	ICALP
Authors	Igor Walukiewicz

Comments (0)