Time-Bounded Verification

DOI10.1007/978-3-642-04081-8_33MaRDI QIDQ3184695zbMATH OpenOpenAlexFDO

Authors Joël Ouaknine, Alexander Rabinovich, James Worrell

Publication date 22 October 2009

Published in CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04081-8_33

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• MTL with Bounded Variability: Decidability and Complexity
• On the decidability and complexity of Metric Temporal Logic over finite words
• Towards a theory of time-bounded verification
• Verification of timed automata via satisfiability checking
• Bounded model checking for timed automata

Cites work

• A theory of timed automata
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• Event-clock automata: a determinizable class of timed automata
• Expressiveness of Metric modalities for continuous time
• Finite variability interpretation of monadic logic of order
• Future temporal logic needs infinitely many modalities
• scientific article; zbMATH DE number 176728 (Why is no real title available?)
• scientific article; zbMATH DE number 1304994 (Why is no real title available?)
• scientific article; zbMATH DE number 1956642 (Why is no real title available?)
• scientific article; zbMATH DE number 2080039 (Why is no real title available?)
• scientific article; zbMATH DE number 2112984 (Why is no real title available?)
• scientific article; zbMATH DE number 1444348 (Why is no real title available?)
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control
• On Expressiveness and Complexity in Real-Time Model Checking
• On the decidability and complexity of Metric Temporal Logic over finite words
• Quantitative temporal logics over the reals: PSpace and below
• Real-time logics: Complexity and expressiveness
• The benefits of relaxing punctuality
• The complexity of temporal logic over the reals
• The monadic theory of order
• The theory of timed I/O automata
• Time-Bounded Verification
• Timed automata and recognizability
• Tools and Algorithms for the Construction and Analysis of Systems
• Using mappings to prove timing properties

Cited in

(24)

• On minimising the maximum expected verification time
• The compound interest in relaxing punctuality
• Bounded variability of metric temporal logic
• scientific article; zbMATH DE number 1670771 (Why is no real title available?)
• On reachability for hybrid automata over bounded time
• Time-Bounded Verification of CTMCs against Real-Time Specifications
• Model Checking Real-Time Systems
• Time-Bounded Verification
• MTL with Bounded Variability: Decidability and Complexity
• Towards a theory of time-bounded verification
• Complexity bounds for the verification of real-time software
• The Expressive Power of Temporal and First-Order Metric Logics
• scientific article; zbMATH DE number 7056237 (Why is no real title available?)
• Computer Science Logic
• Formal Methods in Computer-Aided Design
• Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time
• Timed bounded verification of inclusion based on timed bounded discretized language
• Perspectives of System Informatics
• Inaproximability in weighted timed games
• When do you start counting? Revisiting counting and Pnueli modalities in timed logics
• Metric quantifiers and counting in timed logics and automata
• The value problem for weighted timed games with two clocks is undecidable
• Timed hyperproperties
• Complexity of metric temporal logics with counting and the Pnueli modalities

This page was built for publication: Time-Bounded Verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184695)