Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences-Reference-Cited by-同舟云学术

Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences

Published:2008-04 Issue: Volume:212 Page:149-162
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

de Frutos Escrig David,Rodríguez Carlos Gregorio,Palomino Miguel

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference14 articles.

1. Handbook of Process Algebra;v. Glabbeek,2001

2. D. de Frutos-Escrig, C. Gregorio-Rodríguez, Algebraic and coinductive characterizations of semantics provide general results for free (short extended abstract), in: E. Johnsen, O. Owe, G. Scheneider (Eds.), 19th Nordic Workshop on Programming Theory, Universitetet i Oslo, Institutt for informatikk, 2007, pp. 96–98, research report 366

3. D. de Frutos-Escrig, C. Gregorio-Rodríguez, (Bi)simulations up-to characterise process semantics, Information and Computation (to appear)

4. Ready to preorder: get your BCCSP axiomatization for free!;Aceto,2007

5. Bisimulation can't be traced;Bloom;Journal of the ACM,1995

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Unifying the Linear Time-Branching Time Spectrum of Process Semantics;Logical Methods in Computer Science;2013-06-27

2. Approximate Completed Trace Equivalence of Linear Algebra Transition Systems;Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013;2013

3. Ready to preorder: an algebraic and general proof;The Journal of Logic and Algebraic Programming;2009-08

4. (Bi)simulations up-to characterise process semantics;Information and Computation;2009-02

5. Ready to preorder: The case of weak process semantics;Information Processing Letters;2008-12