JORGENSEN, J.B. und KRISTENSEN, L.M., 1999. Computer aided verification of Lamport’s fast mutual exclusion algorithm using colored Petri nets and occurrence graphs with symmetries. IEEE Transactions on Parallel and Distributed Systems, Parallel and Distributed Systems, IEEE Transactions on, IEEE Trans. Parallel Distrib. Syst. 1 Juli 1999. Vol. 10, no. 7, p. 714-732. DOI 10.1109/71.780866.
Elsevier - Harvard (with titles)Jorgensen, J., Kristensen, L., 1999. Computer aided verification of Lamport’s fast mutual exclusion algorithm using colored Petri nets and occurrence graphs with symmetries. IEEE Transactions on Parallel and Distributed Systems, Parallel and Distributed Systems, IEEE Transactions on, IEEE Trans. Parallel Distrib. Syst. 10, 714-732. https://doi.org/10.1109/71.780866
American Psychological Association 7th editionJorgensen, J., & Kristensen, L. (1999). Computer aided verification of Lamport’s fast mutual exclusion algorithm using colored Petri nets and occurrence graphs with symmetries. IEEE Transactions on Parallel and Distributed Systems, Parallel and Distributed Systems, IEEE Transactions On, IEEE Trans. Parallel Distrib. Syst., 10(7), 714-732. https://doi.org/10.1109/71.780866
Springer - Basic (author-date)Jorgensen J, Kristensen L (1999) Computer aided verification of Lamport’s fast mutual exclusion algorithm using colored Petri nets and occurrence graphs with symmetries. IEEE Transactions on Parallel and Distributed Systems, Parallel and Distributed Systems, IEEE Transactions on, IEEE Trans. Parallel Distrib. Syst. 10:714-732. https://doi.org/10.1109/71.780866
Juristische Zitierweise (Stüber) (Deutsch)Jorgensen, J.B./ Kristensen, L.M., Computer aided verification of Lamport’s fast mutual exclusion algorithm using colored Petri nets and occurrence graphs with symmetries, IEEE Transactions on Parallel and Distributed Systems, Parallel and Distributed Systems, IEEE Transactions on, IEEE Trans. Parallel Distrib. Syst. 1999, 714-732.