On the Expressiveness of Metric Temporal Logic over Bounded Timed Words

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Reachability Problems

• Publication date

  2014-09-22

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-11439-2_11
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Online Monitoring of Metric Temporal Logic

  2014cited by this paper
• Computer Science - Theory and Applications

  2014cited by this paper
• Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points

  2013cited by this paper
• When is Metric Temporal Logic Expressively Complete?

  2012cited by this paper
• Expressive Completeness of Metric Temporal Logic

  2012cited by this paper
• On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing

  2011influential reference
• Advanced Ramsey-Based Büchi Automata Inclusion Testing

  2011cited by this paper
• On Reachability for Hybrid Automata over Bounded Time

  2011cited by this paper
• Towards a Theory of Time-Bounded Verification

  2010influential reference
• CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings

  2009cited by this paper
• Time-Bounded Verification

  2009influential reference
• Some Recent Results in Metric Temporal Logic

  2008cited by this paper
• Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

  2008cited by this paper
• On the expressiveness of MTL in the pointwise and continuous semantics

  2007cited by this paper
• The Cost of Punctuality

  2007cited by this paper
• On the Expressiveness of MTL with Past Operators

  2006influential reference
• Expressiveness of Metric modalities for continuous time

  2006influential reference
• On the decidability of metric temporal logic

  2005cited by this paper
• On the Expressiveness of TPTL and MTL

  2005cited by this paper
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings

  2005cited by this paper
• A Probabilistic Extension of UML Statecharts

  2002cited by this paper
• The Regular Real-Time Languages

  1998cited by this paper
• The Model Checker SPIN

  1997cited by this paper
• Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata

  1994cited by this paper
• A Theory of Timed Automata

  1994cited by this paper
• Specifying real-time properties with metric temporal logic

  1990cited by this paper
• REAL-TIME SYSTEMS .2.

  1989cited by this paper
• On Observing Nondeterminism and Concurrency

  1980cited by this paper
• Tense logic and the theory of linear order

  1968influential reference

• More Than 0s and 1s: Metric Quantifiers and Counting over Timed Words

  2023cites this paper
• Timed hyperproperties

  2020cites this paper
• Büchi-Kamp Theorems for 1-clock ATA

  2018cites this paper
• Online-Monitoring Autonomous Transport Robots with an R-valued Temporal Logic

  2018cites this paper
• On Verifying Timed Hyperproperties

  2018cites this paper
• Online Monitoring of Metric Temporal Logic

  2014influential citation