Occurrence net logics

Fundamenta Informaticae

Volumn 43, Issue 1-4, 2000, Pages 105-127

  Haar, Stefan ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Concurrency; Occurrence (Petri) Nets; Partial order logics; Semantics

Indexed keywords

EID: 0002592373     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-2000-43123406     Document Type: Article

References (20)

1. E. Best and C. Fernández Nonsequential Processes. A Petri Net View, volume 13 of EATCS Monographs. Springer, Berlin, New York, 1988.
2. G. Rozenberg and J. Engelfriet Elementary Net Systems. In W. Reisig and G. Rozenberg [20], pages 12-121.
3. E. A. Emerson and J. Y. Halper. "Sometimes" and "Not Never" Revisited: On Branching vs. Linear Time Logic. Journal of the ACM, 33(1):151-178, 1986.
4. J. Engelfriet. Branching Processes of Petri Nets. Acta Informatica, 28:575-591, 1991.
5. J. Esparza. Model Checking Using Net Unfoldings. Science of Computer Programming, 23:151-195, 1994.
6. C. Fernández and P.S. Thiagarajan. A Lattice Theoretic View of K-Density. In G. Rozenberg, editor, Advances in Petri Nets 1984, volume 188 of Lecture Notes in Computer Science, pages 139-153. Springer, 1985.
7. S. Haar. Branching Processes of general S/T-Systems. In P. Jančar and M. Křétinský (eds.), Proc. of MFCS '98 Workshop on Concurrency, volume 18 of ENTCS, URL: http://www.elsevier.nl/locate/entcs/volume18.html, 1998. Elsevier.
8. J. Esparza, S. Römer, and W. Vogler. An Improvement of McMillan's Unfolding Algorithm. In T. Margaria and B. Steffen, editor, Proceedings of TACAS '96, volume 1055 of LNCS, pages 87-106, Springer, Berlin etc., 1996.
9. J. Esparza, S. Römer, and W. Vogler. An Improvement of McMillan's Unfolding Algorithm. Extended version of [8]; submitted to a journal.
10. S. Katz and D. Peled. Interleaving Set Temporal Logic. Theoretical Computer Science, 75:263-287, 1990.
11. E. Kindler and T. Vesper. ESTL: A Temporal Logic for Events and States. In J. Desel and M. Silva, editor, Applications and Theory of Petri Nets. 19th Int. Conference, Lisbon, Portugal, June 1998, volume 1420 of LNCS, pages 365-384 Springer, Berlin etc., 1998.
12. K. McMillan. Using Unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In 4th Workshop on Computer Aided Verification, Montreal 1992, pages 164-174, 1992.
13. J. Meseguer, U. Montanari, and V. Sassone. On the semantics of petri nets. In CONCUR '92, volume 630 of LNCS, pages 286-301. Springer, Berlin etc, 1992.
14. Faron Moller and Graham Birtwistle (eds.). Logics for Concurrency, volume 1043 of LNCS Tutorial. Springer Verlag, New York etc., 1996.
15. M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures, and domains. Part I. Theoretical Computer Science, 13:85-108, 1981.
16. D. Peled and A. Pnueli. Proving Partial Order Properties. Theoretical Computer Science, 126(2):143-182, 1994.
17. G. Ullrich. Der Entwurf von Steuerstrukturen für parallele Abläufe mit Hilfe von Petri-Netzen (in German). Report, Inst. f. Informatik, Univ. Hamburg, 1977. FBI-HH-B-36/77.
18. I. Virbitskaite. On the Semantics of Concurrency and Nondeterminism: Bisimulations and Temporal Logics. In: Jančar and Křétinský (eds.), Proc. of MFCS '98 Workshop on Concurrency, volume 18 of ENTCS, URL: http://www.elsevier.nl/locate/entcs/volume18.html,1998. Elsevier.
19. W. Vogler. Executions: A New Partial Order Semantics of Petri Nets. TCS, 91:205-238, 1991.
20. W. Reisig and G. Rozenberg, editor. Lectures on Petri Nets I: Basic Models, volume 1492 of LNCS. Springer, Berlin etc., 1998.