To appear |
|
Toni Jussila, Keijo Heljanko, and Ilkka Niemelä. BMC via on-the-fly determinization. STTT - International Journal on Software Tools for Technology Transfer, to appear. |
|
|
Volker Diekert, Tero Harju, and Dirk Nowotka. Weinbaum factorizations of primitive words. Izvestiya VUZ Matematika, to appear. |
|
|
Tero Harju and Dirk Nowotka. Periodicity and unbordered words: A proof of the extended duval conjecture. J. Assoc. Comput. Mach., to appear. |
|
2007 |
|
Javier Esparza, Pradeep Kanade, and Stefan Schwoon. A negative result on depth-first unfoldings. Software Tools for Technology Transfer, 2007. |
|
2006 |
|
Tero Harju and Dirk Nowotka. Binary words with few squares. Bull. EATCS, 89:164–166, June 2006. |
|
|
Javier Esparza, Antonín Kučera, and Richard Mayr. Model checking probabilistic pushdown automata. Logical Methods in Computer Science, 2006. |
|
|
Tero Harju and Dirk Nowotka. On unique factorizations of primitive words. Theoret. Comput. Sci., 356(1–2):186–189, 2006. |
|
|
Tero Harju and Dirk Nowotka. Periods in word extensions. Acta Inform., 43(2):165–171, 2006. |
|
2005 |
|
Thomas Reps, Stefan Schwoon, Somesh Jha, and David Melski. Weighted pushdown systems and their application to interprocedural dataflow analysis. Science of Computer Programming, 58(1–2):206–263, October 2005. Special Issue on the Static Analysis Symposium 2003. |
|
|
Ahmed Bouajjani, Javier Esparza, and Tayssir Touili. Reachability analysis of synchronized PA-systems. Electronic Notes in Theoretical Computer Science, 138(3):153–178, 2005. |
|
|
Barbara König. Analysing input/output-capabilities of mobile processes with a generic type system. Journal of Logic and Algebraic Programming, 63(1):35–58, 2005. |
|
|
Barbara König. A general framework for types in graph rewriting. Acta Informatica, 42(4-5):349–388, 2005. |
|
|
Tero Harju, Arto Lepistö, and Dirk Nowotka. A characterization of periodicity of bi-infinite words. Theoret. Comput. Sci., 347(1–2):419–422, 2005. |
|
Tero Harju and Dirk Nowotka. On the equation  in a free semigroup. Theoret. Comput. Sci., 330(1):117–121, 2005. |
|
|
Tero Harju and Dirk Nowotka. Counting bordered and primitive words with a fixed weight. Theoret. Comput. Sci., 340(2):273–279, 2005. |
|
2004 |
|
Markus Holzer and Stefan Schwoon. Assembling molecules in Atomix is hard. Theoretical Computer Science, 303(3):447–462, February 2004. |
|
|
J. Esparza. A polynomial-time algorithm for checking consistency of free-choice signal transition graphs. Fundamenta Informaticae, 62(2):197–220, 2004. |
|
|
Markus Holzer and Barbara König. On deterministic finite automata and syntactic monoid size. Theoretical Computer Science, 327:319–347, 2004. |
|
|
Matthias Hopf, Michael Luttenberger, and Thomas Ertl. Hierarchical splatting of scattered 4d data. IEEE Computer Graphics and Applications, 24(04):64–72, 2004. |
|
Tero Harju and Dirk Nowotka. The equation  in a free semigroup. Semigroup Forum, 68(3):488–490, 2004. |
|
|
Tero Harju and Dirk Nowotka. Minimal Duval extensions. Internat. J.,Found. Comput. Sci., 15(2):349–354, 2004. |
|
|
Tero Harju and Dirk Nowotka. Border correlation of binary words. J. Combin. Theory, Ser A, 108(2):331–341, 2004. |
|
2003 |
|
Javier Esparza, Antonín Kučera, and Stefan Schwoon. Model-checking LTL with regular valuations for pushdown systems. Information and Computation, 186(2):355–376, November 2003. |
|
|
A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. International Journal on Foundations of Computer Science, 14(4):551–582, 2003. |
|
|
A. Kučera and J. Esparza. A logical viewpoint on process-algebraic quotients. Journal of Logic and Computation, 13(6):863–880, 2003. |
|
|
Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming (TPLP), 3(4&5):519–550, 2003. Also available as (CoRR: arXiv:cs.LO/0305040). |
|
|
Tero Harju and Dirk Nowotka. On the independence of equations in three variables. Theoret. Comput. Sci., 307(1):139–172, 2003. |
|
2002 |
|
J. Esparza and C. Lakos, editors. Applications and theory of petri nets 2002, volume 2360 of Lecture Notes in Computer Science. Springer Verlag, 2002. |
|
|
J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan's unfolding algorithm. Formal Methods in System Design, 20:285–310, 2002. |
|
|
Tero Harju and Dirk Nowotka. Density of critical factorizations. Theor. Inform. Appl., 36(3):315–327, 2002. |
|
2001 |
|
J. Esparza and C. Schröter. Unfolding based algorithms for the reachability problem. Fundamenta Informaticae, 47(3–4):231–245, 2001. |
|
2000 |
|
A. Bouajjani, J. Esparza, A. Finkel, O. Maler, P. Rossmanith, B. Willems, and P. Wolper. An efficient automata approach to some problems on context-free grammars. Information Processing Letters, 74(5–6):221–227, 2000. |
|
|
J. Esparza and S. Melzer. Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design, 16:159–189, 2000. |
|
1999 |
|
J. Esparza, J.L. Lopez, and J. Sesma. Zeros of the Whittaker function associated to Coulomb waves. IMA Journal of Applied Mathematics, 63(1):71–88, 1999. |
|
|
P. Jančar, J. Esparza, and F. Moller. Petri nets and regular behaviours. Journal of Computer and System Sciences, 59(3):476–503, 1999. |
|
1998 |
J. Esparza. Reachability in live and safe free-choice Petri nets is  -complete. Theoretical Computer Science, 198(1–2):211–224, 1998. |
|
1997 |
|
O. Burkart and J. Esparza. More infinite results. Bulletin of the EATCS 62 (Concurrency Column), 1997. |
|
|
J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae, 31:13–26, 1997. |
|
|
J. Esparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997. |
|
1996 |
|
O. Burkart and J. Esparza. More infinite results. Electronic Notes in Theoretical Computer Science, 6, 1996. |
|
|
J. Esparza and G. Bruns. Trapping mutual exclusion in the box calculus. Theoretical Computer Science, 153(1):95–128, 1996. |
|
1995 |
|
A. Cheng, J. Esparza, and J. Palsberg. Complexity results for 1-safe nets. Theoretical Computer Science, 147:117–136, 1995. |
|
|
J. Desel and J. Esparza. Shortest paths in reachability graphs. Journal of Computer and System Sciences, 51(2):314–323, 1995. |
|
|
J. Desel and J. Esparza. Free choice Petri nets, volume 40 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1995. |
|
|
Allan Cheng, Javier Esparza, and Jens Palsberg. Complexity results for 1-safe nets. Theoretical Computer Science, 147(1&2):117–136, 1995. |
|
1994 |
|
J. Esparza and M. Nielsen. Decibility issues for Petri nets - a survey. Journal of Informatik Processing and Cybernetics, 30(3):143–160, 1994. |
|
|
J. Esparza. Reduction and synthesis of live and bounded free choice Petri nets. Information and Computation, 114(1):50–87, 1994. |
|
|
J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23:151–195, 1994. |
|
1993 |
|
J. Desel and J. Esparza. Reachability in cyclic extended free-choice systems. Theoretical Computer Science, 114:93–118, 1993. |
|
1992 |
|
E. Best, J. Desel, and J. Esparza. Traps characterise home states in free choice systems. Theoretical Computer Science, 101:161–176, 1992. |
|
|
J. Esparza and M. Silva. A polynomial time algorithm to decide liveness of bounded free choice nets. Theoretical Computer Science, 102:185–205, 1992. |
|
|
J. Esparza. A solution to the covering problem for 1-bounded conflict-free petri nets using linear programming. Information Processing Letters, 41:313–319, 1992. |
|
1991 |
|
A. Cruz, J. Esparza, and J. Sesma. Zeros of the hankel function of real order out of the principal riemann sheet. Journal of Computational und Applied Mathematics, 37:89–99, 1991. |
|
bibdb) |
© University of Stuttgart |
legal notice