Sciweavers

Share
IFIPTCS
2010
8 years 5 months ago
A Semiring-Based Trace Semantics for Processes with Applications to Information Leakage Analysis
Abstract. We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from...
Michele Boreale, David Clark, Daniele Gorla
JUCS
2002
90views more  JUCS 2002»
8 years 7 months ago
On the Simplification of HD0L Power Series
: Nielsen, Rozenberg, Salomaa and Skyum have shown that HD0L languages are CPDF0L languages. We will generalize this result for formal power series. We will also give a new proof o...
Juha Honkala
TCS
2008
8 years 7 months ago
Another proof of Soittola's theorem
Soittola's theorem characterizes R+- or N-rational formal power series in one variable among the rational formal power series with nonnegative coefficients. We present here a...
Jean Berstel, Christophe Reutenauer
MST
2008
155views more  MST 2008»
8 years 7 months ago
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
Manfred Droste, Paul Gastin
FFA
2008
82views more  FFA 2008»
8 years 7 months ago
Asymptotic behavior of the number of solutions for non-Archimedean Diophantine approximations with restricted denominators
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...
Valérie Berthé, Hitoshi Nakada, Rie ...
APPML
2006
70views more  APPML 2006»
8 years 7 months ago
Legendre transform, Hessian conjecture and tree formula
Let be a polynomial over K (a field of characteristic 0) such that the Hessian of is a nonzero constant. Let
Guowu Meng
STACS
1991
Springer
8 years 11 months ago
On Aperiodic Trace Languages
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
Giovanna Guaiana, Antonio Restivo, Sergio Salemi
LICS
1998
IEEE
8 years 11 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
ICALP
2001
Springer
8 years 12 months ago
Rational Transformations of Formal Power Series
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...
Manfred Droste, Guo-Qiang Zhang
ICALP
2005
Springer
9 years 26 days 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
books