Undecidability Results for Timed Automata With Silent Transitions

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-2009-0063
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Fuzzy-Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Pumping Lemmas for Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Discrete Timed Automata

English

Model Checking for Probabilistic Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2012English

State Identification Problems for Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Robustness in Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Distributed Timed Automata With Independently Evolving Clocks

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2014English

Frequencies in Forgetful Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy