Relativizations for the Logic-Automata Connection

ISSN： 1388-3690

Source： LISP and Symbolic Computation, Vol.18, Iss.1-2, 2005-06, pp. : 79-120

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

Connection methods in linear logic and proof nets construction

By Galmiche D.

Theoretical Computer Science, Vol. 232, Iss. 1, 2000-02 ,pp. : 231-272

Elsevier

Access to resources Recommend Favorite

Automata-based supervisory control logic design for a multi-robot assembly cell

By Lee Jin-Kyu Lee Tae-Eog

International Journal of Computer Integrated Manufacturing, Vol. 15, Iss. 4, 2002-07 ,pp. : 319-334

Taylor & Francis Ltd

Access to resources Recommend Favorite

Decidable verification for reducible timed automata specified in a first order logic with time

By Beauquier D. Slissenko

Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. : 347-388

Elsevier

Access to resources Recommend Favorite

State hyperstructures of tree automata based on lattice-valued logic

By Ghorani Maryam

RAIRO - Theoretical Informatics and Applications, Vol. 52, Iss. 1, 2018-07 ,pp. : 23-42

Edp Sciences

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