论文信息 - Characterizations of Weighted First-Order Logics over Semirings

Characterizations of Weighted First-Order Logics over Semirings

We generalize, in the weighted setup over idempotent, zero-divisor free and totally commutative complete semirings, the expressive equivalence of linear temporal logic, first-order logic, star-free expressions and counter-free Buchi automata.

Eleni Mandrali | George Rahonis

[1] W. Kuich,et al. On Iteration Semiring-Semimodule Pairs , 2007 .

[2] Benedikt Bollig,et al. Pebble Weighted Automata and Transitive Closure Logics , 2010, ICALP.

[3] Christel Baier,et al. Principles of model checking , 2008 .

[4] W. Kuich,et al. The degree of distinguishability of stochastic sequential machines and related problems. , 2005 .

[5] Wolfgang Thomas,et al. Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[6] Amir Pnueli,et al. Once and for all , 1995, J. Comput. Syst. Sci..

[7] Manfred Droste,et al. Weighted automata and multi-valued logics over arbitrary bounded lattices , 2012, Theor. Comput. Sci..

[8] Moshe Y. Vardi. From Philosophical to Industrial Logics , 2009, ICLA.

[9] Paul Gastin,et al. First-order definable languages , 2008, Logic and Automata.

[10] Denis Kuperberg,et al. On the Expressive Power of Cost Logics over Infinite Words , 2012, ICALP.

[11] Manfred Droste,et al. Weighted automata and weighted MSO logics for average and long-time behaviors , 2012, Inf. Comput..

[12] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[13] Werner Kuich,et al. Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata , 1997, Handbook of Formal Languages.