Solving recursive net equations-Reference-Cited by-同舟云学术

Solving recursive net equations

Published:1995 Issue: Volume: Page:605-623
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Best Eike,Koutny Maciej

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60084-1_109.pdf

Reference22 articles.

1. J.Baeten, W.P.Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18 (1990).

2. E.Best, R.Devillers, J.Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. Springer-Verlag, LNCS Vol.665, 130–140 (1993).

3. E.Best, R.Devillers, J.Hall: The Petri Box Calculus: a New Causal Algebra with Multilabel Communication. Advances in Petri Nets 1992, G.Rozenberg (ed.), Springer-Verlag, Lecture Notes in Computer Science Vol. 609, 21–69 (1992).

4. E.Best, C.Fernández: Nonsequential Processes. A Petri Net View. Springer-Verlag, EATCS Monographs on Theoretical Computer Science Vol. 13 (1988).

5. E.Best, M.Koutny: A Refined View of the Box Algebra. Proceedings of the Petri Net Conference'95, G.De Michelis, M.Diaz (eds.), Springer-Verlag, Lecture Notes in Computer Science (1995).

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

1. General parameterised refinement and recursion for the M-net calculus;Theoretical Computer Science;2003-05

2. An Axiomatisation of Duplication Equivalence in the Petri Box Calculus;Application and Theory of Petri Nets 1998;1998

3. Petri nets, process algebras and concurrent programming languages;Lecture Notes in Computer Science;1998

4. Petri boxes and finite precedence;CONCUR '96: Concurrency Theory;1996

5. A refined view of the box algebra;Lecture Notes in Computer Science;1995