Processes of place/transition-nets-Reference-Cited by-同舟云学术

Processes of place/transition-nets

Published: Issue: Volume: Page:264-277
ISSN:
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Goltz U.,Reisig W.

Publisher

Springer-Verlag

Link

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

Reference16 articles.

1. E.Best: A Theorem on the Characteristics on Non-Sequential Processes. Fund. Informaticae, Vol. 3, No 1, pp.77–94 (1980).

2. E. Best, A. Merceron: Discreteness, K-Density and D-Continuity of Occurrence Nets. 6th GI-Conference on theoretical computer science (January 1983), to appear.

3. C. Fernandez, P.S. Thiagarajan: Some Properties of D-continuous Causal Nets. ICALP 1982, Lecture Notes in Computer Science 140 (July 1982).

4. H.J. Genrich, E. Stankiewicz-Wiechno: A Dictionary of Some Basic Notions of Net Theory. Advanced Course on General Net Theory of Processes and Systems Hamburg, Lecture Notes in Computer Science 84, Springer Verlag 1980.

5. J. Grabowski: On Partial Languages. Preprint No. 40/79, Sekt. Mathematik, Humboldt-Univ. (October 1979).

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

1. Token Trail Semantics – Modeling Behavior of Petri Nets with Labeled Petri Nets;Application and Theory of Petri Nets and Concurrency;2023

2. Synthesis and Analysis of Petri Nets from Causal Specifications;Computer Aided Verification;2022

3. Firing Partial Orders in a Petri Net;Application and Theory of Petri Nets and Concurrency;2021

4. Petri’s Understanding of Nets;Carl Adam Petri: Ideas, Personality, Impact;2019

5. Synthesizing Petri Nets from Hasse Diagrams;Lecture Notes in Computer Science;2017