An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.195, Iss.2, 1998-03, pp. : 183-203

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

On algebraic and logical specifications of classes of regular languages

By Khoussainov B.

Theoretical Computer Science, Vol. 298, Iss. 2, 2003-04 ,pp. : 325-346

Elsevier

Access to resources Recommend Favorite

Mapping OWL-S Process Model to Timed Automata: A Model-Checking Timed Temporal Logic Oriented Approach

Journal of Information Technology Research (JITR), Vol. 11, Iss. 1, 2018-01 ,pp. : 29-48

IGI Global_journal

Access to resources Recommend Favorite

Coverage metrics for temporal logic model checking^*

By Chockler Hana Kupferman Orna Vardi Moshe

Formal Methods in System Design, Vol. 28, Iss. 3, 2006-05 ,pp. : 189-212

Springer Publishing Company

Access to resources Recommend Favorite

Deriving Liveness Goals from Temporal Logic Specifications

By Caleiro C. Saake G. Sernadas A.

Journal of Symbolic Computation, Vol. 22, Iss. 5, 1996-11 ,pp. : 521-553

Academic Press

Access to resources Recommend Favorite

Assumption/guarantee specifications in linear-time temporal logic

By Jonsson B. Yih-Kuen T.

Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. : 47-72

Elsevier

Access to resources Recommend Favorite