default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathias Weske
- > Home > Persons > Mathias Weske
Publications
- 2015
[p6]Artem Polyvyanyy
, Sergey Smirnov, Mathias Weske:
Business Process Model Abstraction. Handbook on Business Process Management (1) 2015: 147-165- 2014
- [j42]Artem Polyvyanyy, Luciano García-Bañuelos, Dirk Fahland, Mathias Weske:
Maximal Structuring of Acyclic Process Models. Comput. J. 57(1): 12-35 (2014) - 2012
- [c107]Artem Polyvyanyy, Matthias Weidlich, Mathias Weske:
Isotactics as a Foundation for Alignment and Abstraction of Behavioral Models. BPM 2012: 335-351 - [c101]Andreas Meyer, Artem Polyvyanyy, Mathias Weske:
Weak Conformance of Process Models with respect to Data Objects. ZEUS 2012: 74-80 - 2011
- [j30]Artem Polyvyanyy, Matthias Weidlich, Mathias Weske:
Connectivity of workflow nets: the foundations of stepwise verification. Acta Informatica 48(4): 213-242 (2011) - [j28]Matthias Weidlich, Artem Polyvyanyy, Jan Mendling, Mathias Weske:
Causal Behavioural Profiles - Efficient Computation, Applications, and Evaluation. Fundam. Informaticae 113(3-4): 399-435 (2011) - [j25]Matthias Weidlich, Artem Polyvyanyy, Nirmit Desai, Jan Mendling, Mathias Weske:
Process compliance analysis based on behavioural profiles. Inf. Syst. 36(7): 1009-1025 (2011) - [p2]Artem Polyvyanyy, Mathias Weske:
Flexible Service Systems. The Science of Service Systems 2011: 73-90 - [i2]Artem Polyvyanyy, Luciano García-Bañuelos, Dirk Fahland, Mathias Weske:
Maximal Structuring of Acyclic Process Models. CoRR abs/1108.2384 (2011) - 2010
- [c86]Matthias Weidlich, Artem Polyvyanyy, Jan Mendling, Mathias Weske:
Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition. Petri Nets 2010: 63-83 - [c78]Felix Elliger, Artem Polyvyanyy, Mathias Weske:
On Separation of Concurrency and Conflicts in Acyclic Process Models. EMISA 2010: 25-36 - [c75]Artem Polyvyanyy, Matthias Weidlich, Mathias Weske:
The Biconnected Verification of Workflow Nets. OTM Conferences (1) 2010: 410-418 - 2009
- [c68]Artem Polyvyanyy, Sergey Smirnov, Mathias Weske:
The Triconnected Abstraction of Process Models. BPM 2009: 229-244 - [c65]Artem Polyvyanyy, Sergey Smirnov, Mathias Weske:
On Application of Structural Decomposition for Process Model Abstraction. BPSC 2009: 110-122 - [c59]Artem Polyvyanyy, Luciano García-Bañuelos, Mathias Weske:
Unveiling Hidden Unstructured Regions in Process Models. OTM Conferences (1) 2009: 340-356 - 2008
- [c57]Artem Polyvyanyy, Mathias Weske:
Hypergraph-Based Modeling of Ad-Hoc Business Processes. Business Process Management Workshops 2008: 278-289 - [c53]Ahmed Awad, Artem Polyvyanyy, Mathias Weske:
Semantic Querying of Business Process Models. EDOC 2008: 85-94 - [c52]Artem Polyvyanyy, Sergey Smirnov, Mathias Weske:
Process Model Abstraction: A Slider Approach. EDOC 2008: 325-331 - [c49]Artem Polyvyanyy, Sergey Smirnov, Mathias Weske:
Reducing Complexity of Large EPCs. MobIS 2008: 195-207 - [c47]Artem Polyvyanyy, Mathias Weske:
Flexible Process Graph: A Prologue. OTM Conferences (1) 2008: 427-435
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-09-18 13:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
