CIAA 2003

TECHNICAL PROGRAM


Wednesday, July 16




8:00-8:45Registration
8:45-9:00 Opening
9:00-10:00Chair: Oscar H. Ibarra
Thomas A. Henzinger, University of California, Berkeley
Invited Lecture: Automata for Specifying Component Interfaces
10:00-10:30Coffee Break
10:30-12:00Chair: Tevfik Bultan
Nico Wallmeier, Patrick Huetten, and Wolfgang Thomas
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
Farn Wang and Hsu-Chun Yen
Timing Parameter Characterization of Real-Time Systems
Carsten Fritz
Constructing Buchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Buchi Automata
12:00-2:00Lunch
2:00-3:30Chair: Jacques Sakarovitch
B. Ravikumar
Weak Minimization of DFA - An Algorithm and Applications
Hellis Tamm and Esko Ukkonen
Bideterministic Automata and Minimal Representations of Regular Languages
L. van Zijl
Succinct Descriptions of Regular Languages with Binary Symmetric Difference NFAs
3:30-4:00Coffee Break
4:00-5:30Chair: Sheng Yu
Cyril Allauzen and Mehryar Mohri
An Efficient Pre-Determinization Algorithm
Sylvain Lombardy, Raphael Poss, Yann Regis-Gianas, and Jacques Sakarovitch
Introducing Vaucanson
Andre Kempe, Christof Baeijs, Tamas Gaal, Franck Guingne, and Florent Nicart
WFSC - A New Weighted Finite State Compiler
5:30-6:00Poster Session - Chair: Jianwen Su
6:15Welcoming Reception


Thursday, July 17

8:15-9:00Registration
9:00-10:00Chair: Oscar H. Ibarra
Juhani Karhumaki, University of Turku, Turku, Finland
Invited Lecture: Automata on Words
10:00-10:30Coffee Break
10:30-12:00Chair: Kai Salomaa
Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, and Ayumi Shinohara
Ternary Directed Acyclic Word Graphs
Franck Guingne, Andre Kempe, and Florent Nicart
Complexity of Printing an Acyclic Automaton
A.N. Trahtman
Reducing the Time Complexity of Testing of Local Threshold Testability
12:00-2:00Lunch
2:00-3:30Chair: Hsu-Chun Yen
Dietrich Kuske and Ingmar Meinecke
Branching Automata with Costs - A Way of Reflecting Parallelism in Costs
Gaoyan Xie, Cheng Li and Zhe Dang
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
Farn Wang, Geng-Dian Hwang and Fang Yu
TCTL Inevitability Analysis of Dense-Time Systems
3:30-4:00Coffee Break
4:00-5:30Chair: Zhe Dang
Xiang Fu, Tevfik Bultan and Jianwen Su
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services
Haruo Hosoya and Makoto Murata
Boolean Operations and Inclusion Test for Attribute-Element Constraints
Akihiko Tozawa and Masami Hagiya
XML Schema Containment Checking Based on Semi-implicit Techniques
6:00Conference Dinner


Friday, July 18

9:00-10:30Chair: Omer Egecioglu
Klaus Sutner
The Ehrenfeucht-Mycielski Sequence
Mark Daley, Mark Eramian, Ian McQuillan
Bag Automata and Stochastic Retrieval of Biomolecules in Solution
Tsai-Hung Fan, Shufen Lee, Hsueh-I Lu, Tsung-Shan Tsou, Tsai-Cheng Wang, and Adam Yao
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics
10:30-11:00Coffee Break
11:00-12:00Chair: Bala Ravikumar
M. Vilares, V.M. Darriba, J. Vilares, L. Rodriguez
Robust Parsing in Dynamic Programming
Jose M. Castano
LR Parsing for Global Index Grammars
12:00-12:30General Meeting and CIAA 2004
12:30 Closing
12:30-2:00 Lunch
2:00 Excursion