Partial words versus processes: A short comparison-Reference-Cited by-同舟云学术

Partial words versus processes: A short comparison

Published:1992 Issue: Volume: Page:292-303
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Vogler Walter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-55610-9_176.pdf

Reference21 articles.

1. L. Aceto and M. Hennessy. Towards action-refinement in process algebras. In Proc. 4th LICS, pages 138–145. IEEE Computer Society Press, 1989. A full version has appeared as Computer Science Report 3/88, Dept. Comp. Sci. Univ. of Sussex, 1988.

2. E. Best and R. Devillers. Sequential and concurrent behaviour in Petri net theory. Theoret. Comput. Sci., 55:87–136, 1987.

3. E. Best, R. Devillers, A. Kiehn, and L. Pomello. Concurrent bisimulations in Petri nets. Acta Informatica, 28:231–264, 1991.

4. B. Bollobàs. Graph Theory. An Introductory Course. Graduate Texts in Mathematics 63. Springer, 1990.

5. L. Castellano, G. De Michelis, and L. Pomello. Concurrency vs. interleaving: An instructive example. Bull. EATCS, 31:12–15, 1987.

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

1. Unifying Petri Net Semantics with Token Flows;Applications and Theory of Petri Nets;2009

2. Can I Execute My Scenario in Your Net?;Applications and Theory of Petri Nets 2005;2005

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

4. Algebraic characterization of petri net pomset semantics;CONCUR '97: Concurrency Theory;1997

5. Complete Process Semantics for Inhibitor Nets;Petri Nets and Other Models of Concurrency – ICATPN 2007