Event-Clock Visibly Pushdown Automata

Authors:
Nguyen Tang;Mizuhito Ogawa
Affiliations:
Graduate School of Information Science, Japan Advanced Institute of Science and Technology,;Graduate School of Information Science, Japan Advanced Institute of Science and Technology,
Venue:
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 10
Cited 1

A theory of timed automata

Theoretical Computer Science
Well-structured transition systems everywhere!

Theoretical Computer Science
The Regular Real-Time Languages

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures

Hybrid Systems II
A Determinizable Class of Timed Automata

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Modeling urgency in component-based real-time systems

ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Decision problems for the verification of real-time software

HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Decidability and complexity results for timed automata via channel machines

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Event clock automata: from theory to practice

FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-time pushdown systems and, on the other hand, is determinizable and closed under Boolean operations. We also show that for a timed visibly pushdown automaton A and an ECVPA B, the inclusion problem L(A) ⊆ L(B) is decidable.