Quantitative Evaluation of Systems

@inproceedings{Hlout2017QuantitativeEO,
  title={Quantitative Evaluation of Systems},
  author={Lo{\"i}c H{\'e}lou{\"e}t and Herv{\'e} Marchand},
  booktitle={Lecture Notes in Computer Science},
  year={2017}
}
We prove an analog of Parikh’s theorem for weighted context-free grammars over commutative, idempotent semirings, and exhibit a stochastic context-free grammar with behavior that cannot be realized by any stochastic right-linear context-free grammar. Finally, we show that every unary stochastic context-free grammar with polynomially-bounded ambiguity has an equivalent stochastic rightlinear context-free grammar. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 36 references

Parametric and probabilistic model checking of confidentiality in data dispersal algorithms

2016 International Conference on High Performance Computing & Simulation (HPCS) • 2016
View 20 Excerpts
Highly Influenced

Model Checking and Abstraction

View 20 Excerpts
Highly Influenced

Decidability in Parameterized Verification

SIGACT News • 2016
View 11 Excerpts
Highly Influenced

AONT-LT: A data protection scheme for Cloud and cooperative storage systems

2014 International Conference on High Performance Computing & Simulation (HPCS) • 2014
View 10 Excerpts
Highly Influenced

Formalizing provable anonymity in Isabelle/HOL

Formal Aspects of Computing • 2014
View 20 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…