Frank Leymann

Prof. Dr. Frank Leymann

orcid

Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 November 2007 in Computer
Verified
Journal Article
Closed access
MPMichael P. Papazoglou
Michael P. Papazoglou
PTPaolo Traverso
Paolo Traverso
Schahram DustdarSchahram Dustdar
Schahram Dustdar
FLFrank Leymann
Frank Leymann
Service-oriented computing promotes the idea of assembling application components into a network of services that can be loosely coupled to create flexible, dynamic business processes and agile applications that span organizations and computing platforms. An SOC research road map provides a context for exploring ongoing research activities.

21 April 2008
Verified
Conference Paper
Open access
PDF file
CPCesare Pautasso
Cesare Pautasso
OZOlaf Zimmermann
Olaf Zimmermann
FLFrank Leymann
Frank Leymann

1 June 2008 in International Journal of Cooperative Information Systems
Verified
Journal Article
Closed access
MPMichael P. Papazoglou
Michael P. Papazoglou
PTPaolo Traverso
Paolo Traverso
Schahram DustdarSchahram Dustdar
Schahram Dustdar
FLFrank Leymann
Frank Leymann

1 January 2002 in IBM Systems Journal
Verified
Journal Article
Closed access
FLFrank Leymann
Frank Leymann
DRD. Roller
D. Roller
MSM.-T. Schmidt
M.-T. Schmidt
Web services based on the service-oriented architecture framework provide a suitable technical foundation for making business processes accessible within enterprises and across enterprises. But to appropriately support dynamic business processes and their management, more is needed, namely, the ability to prescribe how Web services are used to implement activities within a business process, how business processes are represented as Web services, and also which business partners perform what parts of the actual business process. In this paper, the relationship between Web services and the management of business processes is worked out and presented in a tutorial-like manner.

1 September 2020 in Quantum Science and Technology
Verified
Journal Article
Open access
FLFrank Leymann
Frank Leymann
JBJOhanna Barzen
JOhanna Barzen
Implementing a gate-based quantum algorithm on an noisy intermediate scale quantum (NISQ) device has several challenges that arise from the fact that such devices are noisy and have limited quantum resources. Thus, various factors contributing to the depth and width as well as to the noise of an implementation of a gate-based algorithm must be understood in order to assess whether an implementation will execute successfully on a given NISQ device. In this contribution, we discuss these factors and their impact on algorithm implementations. Especially, we will cover state preparation, oracle expansion, connectivity, circuit rewriting, and readout: these factors are very often ignored when presenting a gate-based algorithm but they are crucial when implementing such an algorithm on near-term quantum computers. Our contribution will help developers in charge of realizing gate-based algorithms on such machines in (i) achieving an executable implementation, and (ii) assessing the success of their implementation on a given machine.

1 January 1998
Verified
Book Chapter
Closed access
PDF file
RARakesh Agrawal
Rakesh Agrawal
DGDimitrios Gunopulos
Dimitrios Gunopulos
FLFrank Leymann
Frank Leymann