PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Moller, Faron"

Author of the publication

copydeleteadd this publication to your clipboard
Technocamps: Advancing Computer Science Education in Wales.

, and . WiPSCE, page 121-126. ACM, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Lucas Möller University of Stuttgart

Annika Maria Möller University of Stuttgart

 

Other publications of authors with the same name

A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes., , and . Mathematical Structures in Computer Science, 6 (3): 251-259 (1996)A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes., , and . Theor. Comput. Sci., 158 (1&2): 143-159 (1996)Formal Methods in Computation.. Comput. J., 45 (1): 1 (2002)OnTrack: The Railway Verification Toolset - Extended Abstract., , , , , and . ISoLA (2), volume 9953 of Lecture Notes in Computer Science, page 294-296. (2016)The Importance of the Left Merge Operator in Process Algebras.. ICALP, volume 443 of Lecture Notes in Computer Science, page 752-764. Springer, (1990)Technocamps: Advancing Computer Science Education in Wales., and . WiPSCE, page 121-126. ACM, (2015)Safety and Line Capacity in Railways - An Approach in Timed CSP., , , and . IFM, volume 7321 of Lecture Notes in Computer Science, page 54-68. Springer, (2012)Verification of Parallel Systems via Decomposition., and . CONCUR, volume 630 of Lecture Notes in Computer Science, page 62-76. Springer, (1992)Deciding Bisimilarity between BPA and BPP Processes., , and . CONCUR, volume 2761 of Lecture Notes in Computer Science, page 157-171. Springer, (2003)Weak Bisimulation Approximants., , and . CSL, volume 4207 of Lecture Notes in Computer Science, page 365-379. Springer, (2006)