Axiomatizing the algebra of net computations and processes-Reference-Cited by-同舟云学术

Axiomatizing the algebra of net computations and processes

Published:1996-08 Issue:5 Volume:33 Page:641-667
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Degano Pierpaolo,Meseguer José,Montanari Ugo

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF03036469.pdf

Reference34 articles.

1. Andrea Asperti: A Logic for Concurrency. Unpublished manuscript, November 1987.

2. Andrea Asperti, GianLuigi Ferrari, Roberto Gorrieri: Implicative Formulae in the “Proofs as Computation” Analogy. In: Proc. 17th. Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, January 1990, pp. 59–71.

3. Carolyn Brown: Relating Petri Nets to Formulae of Linear Logic. Technical Report ECS-LFCS-89-87. Laboratory for Foundations of Computer Science, University of Edinburgh, June 1989.

4. Carolyn Brown, Doug Gurr: Timing Petri Nets Categorically. In: W. Kuich (ed.), Proc. ICALP ’92. Lecture Notes in Computer Science 623. Springer-Verlag, Berlin, 1992, pp. 571–582.

5. Eike Best, Raymond Devillers: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science 55, 1987, pp. 87–136.

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

1. Whole-grain Petri Nets and Processes;Journal of the ACM;2022-12-19

2. Abstract processes in the absence of conflicts in general place/transition systems;Information and Computation;2022-11

3. Abstract processes and conflicts in place/transition systems;Information and Computation;2021-12

4. Toward a Uniform Approach to the Unfolding of Nets;Electronic Proceedings in Theoretical Computer Science;2018-10-04

5. Dynamic production system identification for smart manufacturing systems;Journal of Manufacturing Systems;2018-07