Amanote Research

Amanote Research

  • Register
  • Sign In

Online Timed Pattern Matching Using Automata

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-030-00151-3_13

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

January 1, 2018

Authors

Alexey BakhirkinThomas FerrèreDejan NickovicOded MalerEugene Asarin

Publisher

Springer International Publishing


Related search

Pattern Matching in Link Streams: Timed-Automata With Finite Memory

Scientific Annals of Computer Science
Applied MathematicsComputer Science
2018English

Fuzzy-Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Discrete Timed Automata

English

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Robustness in Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Verification of Networks of Timed Automata Using mCRL2

2008 IEEE International Symposium on Parallel and Distributed Processing
2008English

Frequencies in Forgetful Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Robust Safety of Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2008English

Pumping Lemmas for Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy