On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces-Reference-Cited by-同舟云学术

On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces

Published:2003 Issue: Volume: Page:109-118
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Blom Stefan,Fokkink Wan,Nain Sumit

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45061-0_10

Reference11 articles.

1. Lect Notes Comput Sci;L. Aceto,2001

2. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Ready-trace semantics for concrete process algebra with the priority operator. The Computer Journal, 30(6):498–506, 1987.

3. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42(1):232–268, 1995.

4. R.J. van Glabbeek. The linear time — branching time spectrum I. The semantics of concrete, sequential processes. In J.A. Bergstra, A. Ponse, and S.A. Smolka, eds, Handbook of Process Algebra, pp. 3–99. Elsevier, 2001.

5. Lect Notes Comput Sci;J.F. Groote,1990

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

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

2. On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation;Lecture Notes in Computer Science;2006

3. On Finite Alphabets and Infinite Bases III: Simulation;CONCUR 2006 – Concurrency Theory;2006

4. Finite Equational Bases in Process Algebra: Results and Open Questions;Processes, Terms and Cycles: Steps on the Road to Infinity;2005

5. Bisimilarity Is Not Finitely Based over BPA with Interrupt;Algebra and Coalgebra in Computer Science;2005