- Nguyen Tang. A Tighter Bound for the Determinization of Visibly
Pushdown Automata. (regular)
- Giuseppe Castagna and Luca Padovani. A preliminary proposal of
decidable testing relations for infinitary asynchronous CCS.
(position)
- Florent Bouchy, Alain FINKEL and Pierluigi San Pietro.
Dense-choice
Counter Machines revisited. (regular)
-
Etienne Andre and laurent fribourg. An Inverse Method for
Policy-Iteration Based Algorithms. (regular)
- Bahareh Badban, Jan-Georg Smaus and Stefan Leue. Automated
Predicate
Abstraction for Real-Time Models. (position)
- Christophe Morvan. On external presentations of infinite graphs.
(survey)
|