Delayed logic and finite state machines. Theory of Computing Machine Design, pp.1-35, 1960. ,
DOI : 10.1109/focs.1961.13
An efficiency preorder for processes, Acta Informatica, vol.25, issue.1, pp.737-760, 1992. ,
DOI : 10.1007/BF01191894
URL : http://www.cse.iitd.ernet.in/~sak/reports/effpre.ps.gz
Process Algebra: Equational Theories of Communicating Processes, 2010. ,
DOI : 10.1017/CBO9781139195003
Ready-trace semantics for concrete process algebra with the priority operator, Comput. J, vol.30, issue.6, pp.498-506, 1987. ,
Unguardedness mostly means many solutions, Theor. Comput. Sci, vol.412, issue.28, pp.3090-3100, 2011. ,
Bisimulation can't be traced, Journal of the ACM, vol.42, issue.1, pp.232-268, 1995. ,
DOI : 10.1145/200836.200876
Coinduction up-to in a fibrational setting, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2014. ,
DOI : 10.1145/2603088.2603149
URL : https://hal.archives-ouvertes.fr/hal-00936488
Checking nfa equivalence with bisimulations up to congruence, Proc. POPL'13, pp.457-468, 2013. ,
DOI : 10.1145/2429069.2429124
URL : https://hal.archives-ouvertes.fr/hal-00639716
Monreale A General Theory of Barbs, Contexts, and Labels ACM Trans. Comput. Log, vol.1535, issue.4, pp.1-3527, 2014. ,
Testing equivalence as a bisimulation equivalence, Formal Aspects of Computing, vol.85, issue.n. 2, pp.1-20, 1993. ,
DOI : 10.1007/BF01211314
URL : http://www.cs.umd.edu/~rance/publications/papers/cav89b.ps.gz
Testing equivalences for processes, Theoretical Computer Science, vol.34, pp.83-133, 1984. ,
The linear time?branching time spectrum II (the semantics of sequential systems with silent moves), Proc. CONCUR '93, 1993. ,
The linear time - branching time spectrum, Handbook of Process Algebra, pp.3-99, 2001. ,
DOI : 10.1007/BFb0039066
Structured operational semantics and bisimulation as a congruence, Information and Computation, vol.100, issue.2, pp.202-260, 1992. ,
DOI : 10.1016/0890-5401(92)90013-6
URL : https://doi.org/10.1016/0890-5401(92)90013-6
Communicating Sequential Processes, 1985. ,
On reduction-based process semantics, Theoretical Computer Science, vol.152, issue.2, pp.437-486, 1995. ,
DOI : 10.1016/0304-3975(95)00074-7
URL : https://doi.org/10.1016/0304-3975(95)00074-7
Introduction to Automata Theory, Languages, and Computation, 2006. ,
DOI : 10.1145/568438.568455
Representing Contractive Functions on Streams, 2011. ,
Small bisimulations for reasoning about higher-order imperative programs, Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.141-152, 2006. ,
DOI : 10.1145/1111037.1111050
Simple language equations, Bulletin of the EATCS, vol.85, pp.81-102, 2005. ,
Relational Reasoning about Contexts, Higher-order operational techniques in semantics, pp.91-135, 1998. ,
DOI : 10.7146/brics.v4i24.18950
URL : http://www.brics.dk/RS/97/Ref/BRICS-RS-97-Ref/../../../../RS/97/24/BRICS-RS-97-24.ps.gz
Bisimulation in Untyped Lambda Calculus:, Electronic Notes in Theoretical Computer Science, vol.20, pp.346-374, 1999. ,
DOI : 10.1016/S1571-0661(04)80083-5
URL : https://doi.org/10.1016/s1571-0661(04)80083-5
Abstract GSOS Rules and a Modular Treatment of Recursive Definitions, Logical Methods in Computer Science, vol.9, issue.3, p.2013 ,
DOI : 10.2168/LMCS-9(3:28)2013
Communication and Concurrency, 1989. ,
Barbed bisimulation, Proc. 19th ICALP, pp.685-695, 1992. ,
DOI : 10.1007/3-540-55719-9_114
A complete axiomatisation for observational congruence of finite-state behaviours, Information and Computation, vol.81, issue.2, pp.227-247, 1989. ,
DOI : 10.1016/0890-5401(89)90070-9
Lambda-Calculus Models of Programming Languages, 1968. ,
Divergence and fair testing, Proceedings of ICALP'95, pp.648-659, 1995. ,
DOI : 10.1007/3-540-60084-1_112
Algebraic Systems and Pushdown Automata, Handbook of Weighted Automata, EATCS Series, pp.257-289, 2009. ,
DOI : 10.1007/978-3-642-01492-5_7
Sound Bisimulations for Higher-Order Distributed Process Calculus, Proc. FOSSACS, pp.123-137, 2011. ,
DOI : 10.1145/1284320.1284325
Howe's method Advanced Topics in Bisimulation and Coinduction, 2012. ,
Enhancements of the bisimulation proof method Advanced Topics in Bisimulation and Coinduction, 2012. ,
Fair testing. Information and Computation, pp.125-198, 2007. ,
The theory and practice of concurrency, 1998. ,
Understanding Concurrent Systems, 2010. ,
DOI : 10.1007/978-1-84882-258-0
Coinductive Proof Techniques for Language Equivalence, Proc. LATA, pp.480-492, 2013. ,
DOI : 10.1007/978-3-642-37064-9_42
Locality and true-concurrency in calculi for mobile processes, TACS'94, pp.405-424, 1994. ,
DOI : 10.1007/3-540-57887-0_107
URL : ftp://ftp-sop.inria.fr/meije/theorie-par/davides/loc.ps.Z
Computing With Contexts A simple approach, Electronic Notes in Theoretical Computer Science, vol.10, 1998. ,
DOI : 10.1016/S1571-0661(05)80694-2
URL : https://doi.org/10.1016/s1571-0661(05)80694-2
The problem of ???weak bisimulation up to???, Proc. CONCUR '92, pp.32-46, 1992. ,
DOI : 10.1007/BFb0084781
The ?-calculus: a Theory of Mobile Processes, 2001. ,
Environmental bisimulations for higher-order languages, ACM Trans. Program. Lang. Syst, vol.33, issue.1, p.5, 2011. ,
DOI : 10.1109/lics.2007.17
URL : https://hal.archives-ouvertes.fr/hal-01337665