1. P.A. Abdulla, M.F. Atig & J. Stenman (2012): Dense-timed pushdown automata. In: Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on. IEEE, doi:10.1109/LICS.2012.15.
  2. P.A. Abdulla, M.F. Atig & J. Stenman (2012): The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems. Language and Automata Theory and Applications, pp. 58–69, doi:10.1007/978-3-642-28332-1.
  3. P.A. Abdulla & B. Jonsson (1998): Verifying networks of timed processes. Tools and Algorithms for the Construction and Analysis of Systems, pp. 298–312, doi:10.1007/BFb0054179.
  4. P.A. Abdulla & B. Jonsson (2003): Model checking of systems with many identical timed processes. Theoretical Computer Science 290(1), pp. 241–264, doi:10.1016/S0304-3975(01)00330-9.
  5. R. Alur & D.L. Dill (1994): A theory of timed automata. Theoretical computer science 126(2), pp. 183–235, doi:10.1016/0304-3975(94)90010-8.
  6. A. Bouajjani, J. Esparza & O. Maler (1997): Reachability Analysis of Pushdown Automata: Application to Model-Checking. In: CONCUR, LNCS 1243. Springer, pp. 135–150, doi:10.1007/3-540-63141-0_10.

Comments and questions to:
For website issues: