CSP, partial automata, and coalgebras

Author： Wolter U.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.280, Iss.1, 2002-05, pp. : 3-34

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

Relational concurrent refinement part III: traces, partial relations and automata

By Derrick John   Boiten Eerke  

Formal Aspects of Computing, Vol. 26, Iss. 2, 2014-03 ,pp. : 407-432

Springer Publishing Company

Access to resources Recommend Favorite

Specifying Coalgebras with Modal Logic

By Kurz A.  

Electronic Notes in Theoretical Computer Science, Vol. 11, Iss. 1, 2004-01 ,pp. : 1-15

Elsevier

Access to resources Recommend Favorite

Guarded induction on final coalgebras

By Pavlovic D.  

Electronic Notes in Theoretical Computer Science, Vol. 11, Iss. 1, 2004-01 ,pp. : 1-18

Elsevier

Access to resources Recommend Favorite

Toposes of Coalgebras and Hidden Algebras

By Worrell J.  

Electronic Notes in Theoretical Computer Science, Vol. 11, Iss. 1, 2004-01 ,pp. : 1-19

Elsevier

Access to resources Recommend Favorite

Specifying coalgebras with modal logic

By Kurz A.  

Theoretical Computer Science, Vol. 260, Iss. 1, 2001-06 ,pp. : 119-138

Elsevier

Access to resources Recommend Favorite