The minimal cost reachability problem in priced timed pushdown systems

Authors:
Parosh Aziz Abdulla;Mohamed Faouzi Atig;Jari Stenman
Affiliations:
Uppsala University, Sweden;Uppsala University, Sweden;Uppsala University, Sweden
Venue:
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Year:
2012

Citing 13
Cited 2

A theory of timed automata

Theoretical Computer Science
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures

Hybrid Systems II
Binary Reachability Analysis of Discrete Pushdown Timed Automata

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Optimal paths in weighted timed automata

Theoretical Computer Science - Logic, semantics and theory of programming
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Analysis of Timed Recursive State Machines

TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning
Recursive timed automata

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Computing Optimal Coverability Costs in Priced Timed Petri Nets

LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Decision problems for the verification of real-time software

HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Optimal strategies in priced timed game automata

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Dense-Timed Pushdown Automata

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Nested timed automata

FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces the model of priced timed pushdown systems as an extension of discrete-timed pushdown systems with a cost model that assigns multidimensional costs to both transitions and stack symbols. For this model, we consider the minimal cost reachability problem: i.e., given a priced timed pushdown system and a target set of configurations, determine the minimal possible cost of any run from the initial to a target configuration. We solve the problem by reducing it to the reachability problem in standard pushdown systems.