A Complete Inference System for Regular Processes with Silent Moves-Reference-Cited by-同舟云学术

A Complete Inference System for Regular Processes with Silent Moves

Published:1987 Issue: Volume: Page:21-81
ISSN:0049-237X
Container-title:Logic Colloquium '86, Proceedings of the Colloquium held in Hull
language:
Short-container-title:

Author:

Bergstra J.A.,Klop J.W.

Publisher

Elsevier

Reference15 articles.

1. J.C.M. Baeten, J.A. Bergstra, J.W. Klop (1985). On the consistency of Koomen's Fair Abstraction Rule, CWI Report CS-R8511, Amsterdam. To be published in TCS.

2. J.A. Bergstra, J.W. Klop (1983). An abstraction mechanism for process algebra, Report IW 231/83, Centre for Mathematics and Computer Science, Amsterdam 1983.

3. Process algebra for synchronous communication;Bergstra;Information and Control,1984

4. Algebra of communicating processes with abstraction;Bergstra;Theor. Comp. Sci.,1985

5. J.A. Bergstra, J.W. Klop (1986). Process Algebra: Specification and Verification in Bisimulation Semantics, Proceedings of the CWI Symposium Mathematics and Computer Science 1986 (eds. M. Hazewinkel, J.K. Lenstra, L.G.L.T. Meertens), CWI Monographs 4, 61–94, North-Holland, Amsterdam 1986.

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

1. The quest for minimal quotients for probabilistic and Markov automata;Information and Computation;2018-10

2. Is observational congruence on μ-expressions axiomatisable in equational Horn logic?;Information and Computation;2010-06

3. An axiomatic semantics for the synchronous language Gentzen;Journal of Computer and System Sciences;2003-03

4. An Axiomatic Semantics for the Synchronous Language Gentzen;Lecture Notes in Computer Science;2001

5. Deriving Complete Inference Systems for a Class of GSOS Languages Generating Regular Behaviours;CONCUR '94: Concurrency Theory;1994