Failure-based Equivalences Are Faster Than Many Believe-Reference-Cited by-同舟云学术

Failure-based Equivalences Are Faster Than Many Believe

Published:1995 Issue: Volume: Page:326-340
ISSN:1431-1682
Container-title:Structures in Concurrency Theory
language:
Short-container-title:

Author:

Valmari Antti

Publisher

Springer London

Link

http://link.springer.com/content/pdf/10.1007/978-1-4471-3078-9_22

Reference33 articles.

1. Kanellakis, P. C. & Smolka, S. A.: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing, Montreal, Canada, August 1983, pp. 228–240.

2. Kanellakis, P. C. & Smolka, S. A.: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation 86 (1990) pp. 43–68.

3. Milner, R.: Communication and Concurrency. Prentice-Hall 1989, 260 p.

4. Brookes, S. D., Hoare, C. A. R. & Roscoe, A. W.: A Theory of Communicating Sequential Processes. Journal of the ACM, 31 (3) 1984, pp. 560–599.

5. Brookes, S. D. & Rounds, W. C.: Behavioural Equivalence Relationships Induced by Programming Logics. Proceedings of 10th International Conference on Automata, Languages, and Programming, Barcelona, Spain, Lecture Notes in Computer Science 154, Springer-Verlag 1983, pp. 97–108.

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

1. Testing Preorders for dMTS;ACM Transactions on Embedded Computing Systems;2017-04-14

2. Failure Semantics for Modal Transition Systems;ACM Transactions on Embedded Computing Systems;2015-12-08

3. On constructibility and unconstructibility of LTS operators from other LTS operators;Acta Informatica;2015-02-03

4. External Behaviour of Systems of State Machines with Variables;Transactions on Petri Nets and Other Models of Concurrency VII;2013

5. Failure-based equivalence of constraint automata;International Journal of Computer Mathematics;2010-09