Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols

Publisher： Elsevier

ISSN： 1571-0661

Source： Electronic Notes in Theoretical Computer Science, Vol.50, Iss.4, 2004-01, pp. : 1-15

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Deciding Boolean Algebra with Presburger Arithmetic

By Kuncak Viktor Nguyen Huu Rinard Martin

Journal of Automated Reasoning, Vol. 36, Iss. 3, 2006-04 ,pp. : 213-239

Springer Publishing Company

Access to resources Recommend Favorite

Presburger liveness verification of discrete timed automata

By Dang Z. Pietro P.S. Kemmerer R.A.

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 413-438

Elsevier

Access to resources Recommend Favorite

The definable criterion for definability in Presburger arithmetic and its applications

By Muchnik A.A.

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1433-1444

Elsevier

Access to resources Recommend Favorite

Analyzing probabilistic pushdown automata

By Brázdil Tomáš Esparza Javier Kiefer Stefan Kučera Antonín

Formal Methods in System Design, Vol. 43, Iss. 2, 2013-10 ,pp. : 124-163

Springer Publishing Company

Access to resources Recommend Favorite

Representation of Finite State Automata in Recurrent Radial Basis Function Networks

By Frasconi P. Gori M. Maggini M. Soda G.

Machine Learning, Vol. 23, Iss. 1, 1996-04 ,pp. : 5-32

Springer Publishing Company

Access to resources Recommend Favorite