Reference : On the construction of automata from linear arithmetic constraints
Scientific congresses and symposiums : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/30759
On the construction of automata from linear arithmetic constraints
English
Wolper, Pierre mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Informatique (parallélisme et banques de données) >]
Boigelot, Bernard mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Informatique >]
Mar-2000
Lecture Notes in Computer Science
Springer
1785
Tools and Algorithms for the Construction and Analysis of Systems
1-19
No
Yes
International
0302-9743
1611-3349
Berlin
Germany
Tools and Algorithms for the Construction and Analysis of Systems 6th International Conference, TACAS 2000
March 25 – April 2, 2000
Berlin
Germany
[en] linear constraints ; automata
[en] This paper presents an overview of algorithms for constructing automata from linear arithmetic constraints. It identifies one case in which the special structure of the automata that are constructed allows a linear-time determinization procedure to be used. Furthermore, it shows through theoretical analysis and experiments that the special structure of the constructed automata does, in quite a general way, render the usual upper bounds on automata operations vastly overpessimistic.
Researchers
http://hdl.handle.net/2268/30759
10.1007/3-540-46419-0_1
The original publication is available at www.springerlink.com

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Restricted access
BW-TACAS2000.pdfPublisher postprint269.23 kBRequest copy
Open access
BW-TACAS2000.pdfAuthor postprint219.95 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.