Specifying real-time properties with metric temporal logic
Real-Time Systems
Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Formal Methods for Real-Time Computing
Formal Methods for Real-Time Computing
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
The complexity of propositional linear temporal logics in simple cases
Information and Computation
Verification in Continuous Time by Discrete Reasoning
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Digitisation and Full Abstraction for Dense-Time Model Checking
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
On Discretization of Delays in Timed Automata and Digital Circuits
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Timing analysis of asynchronous circuits using timed automata
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Verfying Invariance Properties of Timed Systems with Duration Variables
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
(Real) Time: A Philosophical Perspective
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Sampling Semantics of Duration Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
An Until Hierarchy for Temporal Logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Revisiting Digitization, Robustness, and Decidability for Timed Automata
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science
The stuttering principle revisited
Acta Informatica
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Trio2Promela: A Model Checker for Temporal Metric Specifications
ICSE COMPANION '07 Companion to the proceedings of the 29th International Conference on Software Engineering
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Automated Verification of Dense-Time MTL Specifications Via Discrete-Time Approximation
FM '08 Proceedings of the 15th international symposium on Formal Methods
MTL with Bounded Variability: Decidability and Complexity
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Practical Automated Partial Verification of Multi-paradigm Real-Time Models
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Robustness of temporal logic specifications for continuous-time signals
Theoretical Computer Science
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
Integrated Modeling and Verification of Real-Time Systems through Multiple Paradigms
SEFM '09 Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
Timer formulas and decidable metric temporal logic
Information and Computation
On sampling abstraction of continuous time logic with durations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Robust sampling for MITL specifications
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
On the expressiveness of MTL variants over dense time
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Integrating discrete- and continuous-time metric temporal logics through sampling
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
On sampled semantics of timed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The embedded systems design challenge
FM'06 Proceedings of the 14th international conference on Formal Methods
Algorithms for monitoring real-time properties
RV'11 Proceedings of the Second international conference on Runtime verification
Hi-index | 0.00 |
This article revisits the classical notion of sampling in the setting of real-time temporal logics for the modeling and analysis of systems. The relationship between the satisfiability of metric temporal logic (MTL) formulas over continuous-time models and over discrete-time models is studied. It is shown to what extent discrete-time sequences obtained by sampling continuous-time signals capture the semantics of MTL formulas over the two time domains. The main results apply to “flat” formulas that do not nest temporal operators and can be applied to the problem of reducing the verification problem for MTL over continuous-time models to the same problem over discrete time, resulting in an automated partial practically efficient discretization technique.