On the coarsest congruence within global-clock-bounded equivalence

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.198, Iss.1, 1998-05, pp. : 225-237

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

From Bisimulation to Simulation: Coarsest Partition Problems

By Gentilini R. Piazza C. Policriti A.

Journal of Automated Reasoning, Vol. 31, Iss. 1, 2003-09 ,pp. : 73-103

Springer Publishing Company

Access to resources Recommend Favorite

Global Freedom of Expression Within Nontextual Frameworks

By Søraker Johnny Hartz

The Information Society, Vol. 24, Iss. 1, 2008-01 ,pp. : 40-46

Routledge Ltd

Access to resources Recommend Favorite

Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search

International Journal of Swarm Intelligence Research (IJSIR), Vol. 2, Iss. 2, 2011-04 ,pp. : 42-51

IGI Global_journal

Access to resources Recommend Favorite

Abstract Congruence Closure

By Bachmair Leo Tiwari Ashish Vigneron Laurent

Journal of Automated Reasoning, Vol. 31, Iss. 2, 2003-01 ,pp. : 129-168

Springer Publishing Company

Access to resources Recommend Favorite

Congruence lattices 101

By Gratzer G.

Theoretical Computer Science, Vol. 217, Iss. 2, 1999-04 ,pp. : 279-289

Elsevier

Access to resources Recommend Favorite