Sciweavers

644 search results - page 31 / 129
» Precedence Automata and Languages
Sort
View
EMNLP
2009
14 years 9 months ago
Supervised Models for Coreference Resolution
Traditional learning-based coreference resolvers operate by training a mentionpair classifier for determining whether two mentions are coreferent or not. Two independent lines of ...
Md. Altaf ur Rahman, Vincent Ng
FSEN
2009
Springer
15 years 6 months ago
Modular Schedulability Analysis of Concurrent Objects in Creol
We present an automata theoretic framework for modular schedulability analysis of real time asynchronous objects modeled in the language Creol. In previous work we analyzed the sch...
Frank S. de Boer, Tom Chothia, Mohammad Mahdi Jagh...
ENTCS
2008
105views more  ENTCS 2008»
14 years 11 months ago
Checking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Tobias Blechmann, Christel Baier
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 6 months ago
Finitary languages
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
Krishnendu Chatterjee, Nathanaël Fijalkow