Sciweavers

644 search results - page 53 / 129
» Precedence Automata and Languages
Sort
View
CORR
2006
Springer
99views Education» more  CORR 2006»
15 years 6 months ago
Rational stochastic languages
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
François Denis, Yann Esposito
ICFEM
2009
Springer
16 years 22 days ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
SPIN
2010
Springer
15 years 4 months ago
Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance
In our earlier work we have proposed using the declarative language DecSerFlow for modeling, analysis and enactment of processes in autonomous web services. DecSerFlow uses constra...
Maja Pesic, Dragan Bosnacki, Wil M. P. van der Aal...
HYBRID
2005
Springer
15 years 11 months ago
The Discrete Time Behavior of Lazy Linear Hybrid Automata
We study the class of lazy linear hybrid automata with finite precision. The key features of this class are: – The observation of the continuous state and the rate changes assoc...
Manindra Agrawal, P. S. Thiagarajan
ICALP
2005
Springer
15 years 11 months ago
Weighted Automata and Weighted Logics
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
Manfred Droste, Paul Gastin