The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems-Reference-Cited by-同舟云学术

The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems

Published:2012 Issue: Volume: Page:58-69
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Abdulla Parosh Aziz,Atig Mohamed Faouzi,Stenman Jari

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-28332-1_6

Reference15 articles.

1. Lecture Notes in Computer Science;P.A. Abdulla,2009

2. Abdulla, P.A., Mayr, R.: Computing optimal coverability costs in priced timed Petri nets. In: LICS 2011, pp. 399–408. IEEE Computer Society (2011)

3. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)

4. Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. Theor. Comput. Sci. 318(3), 297–322 (2004)

5. Benerecetti, M., Minopoli, S., Peron, A.: Analysis of timed recursive state machines. In: Markey, N., Wijsen, J. (eds.) TIME, pp. 61–68. IEEE Computer Society (2010)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Revisiting Underapproximate Reachability for Multipushdown Systems;Tools and Algorithms for the Construction and Analysis of Systems;2020

2. Parallel Model Checking on Pushdown Systems;2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom);2018-12

3. Analyzing pushdown systems with stack manipulation;Information and Computation;2018-04

4. Nested Timed Automata with Diagonal Constraints;Formal Methods and Software Engineering;2017

5. Weighted Pushdown Systems with Indexed Weight Domains;Logical Methods in Computer Science;2016-06-29