Sciweavers

432 search results - page 5 / 87
» Interaction Abstraction for Compositional Finite State Syste...
Sort
View
CONCUR
2004
Springer
13 years 11 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
FSMNLP
2005
Springer
14 years 1 months ago
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
Alexander Geyken, Thomas Hanneforth
PTS
2008
98views Hardware» more  PTS 2008»
13 years 9 months ago
Modular System Verification by Inference, Testing and Reachability Analysis
Verification of a modular system composed of communicating components is a difficult problem, especially when the models of the components are not available. Conventional testing t...
Roland Groz, Keqin Li 0002, Alexandre Petrenko, Mu...
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
13 years 5 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
IMCSIT
2010
13 years 5 months ago
Building and Using Existing Hunspell Dictionaries and TeX Hyphenators as Finite-State Automata
Abstract--There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word h...
Tommi Pirinen, Krister Lindén