Timed Automata with Integer Resets: Language Inclusion and Expressiveness

DOI10.1007/978-3-540-85778-5_7zbMath1171.68536OpenAlexW1582770869MaRDI QIDQ3543291

Paritosh K. Pandya, Lakshmi Manasa, P. Vijay Suman, Shankara Narayanan Krishna

Publication date: 2 December 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85778-5_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

A survey of timed automata for the development of real-time systems ⋮ Control strategies for off-line testing of timed systems ⋮ Timed Automata with Integer Resets: Language Inclusion and Expressiveness ⋮ Model checking weighted integer reset timed automata ⋮ A game approach to determinize timed automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions ⋮ An Introduction to Timed Automata ⋮ Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language

Uses Software

• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• Folk theorems on the determinization and minimization of timed automata
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Undecidable Problems About Timed Automata
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Undecidability Results for Timed Automata with Silent Transitions
• CONCUR 2004 - Concurrency Theory
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Formal Methods for the Design of Real-Time Systems

This page was built for publication: Timed Automata with Integer Resets: Language Inclusion and Expressiveness