Abstract
A process is a collection of actions that were already, are currently being, or must be taken in order to achieve a goal, where an action is an atomic unit of work, for instance, a business activity or an instruction of a computer program. A process repository is an organized collection of models that describe processes, for example, a business process repository and a software repository. Process repositories without facilities for process querying and process manipulation are like databases without Structured Query Language , that is, collections of elements without effective means for deriving value from them. Process Query Language (PQL) is a domain-specific programming language for managing processes described in models stored in process repositories. PQL can be used to query and manipulate process models based on possibly infinite collections of processes that they represent, including processes that support concurrent execution of actions. This chapter presents PQL, its current features, publicly available implementation, planned design and implementation activities, and open research problems associated with the design of the language.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Adriansyah, A.: Aligning observed and modeled behavior. Ph.D. thesis, TU/e (2014). http://dx.doi.org/10.6100/IR770080
Billington, J., Christensen, S., van Hee, K.M., Kindler, E., Kummer, O., Petrucci, L., Post, R., Stehno, C., Weber, M.: The Petri net markup language: Concepts, technology, and tools. In: ICATPN. LNCS, vol. 2679, pp. 483–505. Springer, New York (2003)
Carmona, J., van Dongen, B.F., Solti, A., Weidlich, M.: Conformance Checking - Relating Processes and Models. Springer, New York (2018). https://doi.org/10.1007/978-3-319-99414-7
Dijkman, R.M., Dumas, M., Ouyang, C.: Semantics and analysis of business process models in BPMN. Inf. Softw. Technol. 50(12), 1281–1294 (2008)
Esparza, J., Nielsen, M.: Decidability issues for Petri nets—a survey. Bull. EATCS 52, 244–262 (1994)
Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s unfolding algorithm. Formal Methods Syst. Des. 20(3), 285–310 (2002)
Fahland, D., van der Aalst, W.M.: Model repair—aligning process models to reality. Inf. Syst. 47, 220–243 (2015). http://dx.doi.org/10.1016/j.is.2013.12.007
Grünwald, P.D.: The Minimum Description Length Principle (Adaptive Computation and Machine Learning). The MIT Press, Cambridge (2007)
Hack, M.: Decidability Questions for Petri Nets. Outstanding Dissertations in the Computer Sciences. Garland Publishing, New York (1975)
Kalenkova, A.A., Polyvyanyy, A., Rosa, M.L.: A framework for estimating simplicity of automatically discovered process models based on structural and behavioral characteristics. In: BPM. Lecture Notes in Computer Science, vol. 12168, pp. 129–146. Springer, New York (2020)
Laue, R., Gruhn, V.: Complexity metrics for business process models. In: BIS. LNI, vol. P-85, pp. 1–12. GI (2006)
Lieben, J., Jouck, T., Depaire, B., Jans, M.: An improved way for measuring simplicity during process discovery. In: EOMAS@CAiSE. Lecture Notes in Business Information Processing, vol. 332, pp. 49–62. Springer, New York (2018)
Lindland, O.I., Sindre, G., Sølvberg, A.: Understanding quality in conceptual modeling. IEEE Softw. 11(2), 42–49 (1994)
Lipton, R.: The Reachability Problem Requires Exponential Space. Research report. Department of Computer Science, Yale University (1976)
McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Computer Aided Verification (CAV). Lecture Notes in Computer Science, vol. 663, pp. 164–177. Springer, New York (1992)
Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, Part I. Theor. Comput. Sci. 13, 85–108 (1981)
Polyvyanyy, A., van der Aalst, W.M.P., ter Hofstede, A.H.M., Wynn, M.T.: Impact-driven process model repair. ACM Trans. Softw. Eng. Methodol. 25(4), 28:1–28:60 (2017)
Polyvyanyy, A., Armas-Cervantes, A., Dumas, M., García-Bañuelos, L.: On the expressive power of behavioral profiles. Formal Asp. Comput. 28(4), 597–613 (2016). http://dx.doi.org/10.1007/s00165-016-0372-4
Polyvyanyy, A., ter Hofstede, A.H.M., Rosa, M.L., Ouyang, C., Pika, A.: Process query language: Design, implementation, and evaluation. CoRR abs/1909.09543 (2019)
Polyvyanyy, A., La Rosa, M., ter Hofstede, A.H.M.: Indexing and efficient instance-based retrieval of process models using untanglings. In: CAiSE. LNCS, vol. 8484, pp. 439–456. Springer, New York (2014)
Polyvyanyy, A., Ouyang, C., Barros, A., van der Aalst, W.M.P.: Process querying: Enabling business intelligence through query-based process analytics. Dec. Support Syst. 100, 41–56 (2017). https://doi.org/10.1016/j.dss.2017.04.011
Polyvyanyy, A., Pika, A., ter Hofstede, A.H.M.: Scenario-based process querying for compliance, reuse, and standardization. Inf. Syst. 93, 101563 (2020)
Polyvyanyy, A., Solti, A., Weidlich, M., Ciccio, C.D., Mendling, J.: Monotone precision and recall measures for comparing executions and specifications of dynamic systems. ACM Trans. Softw. Eng. Methodol. 29(3), 17:1–17:41 (2020)
Polyvyanyy, A., Weidlich, M.: Towards a compendium of process technologies: the jBPT library for process model analysis. In: CAiSE Forum, CEUR Workshop Proceedings, vol. 998, pp. 106–113. CEUR-WS.org (2013)
Polyvyanyy, A., Weidlich, M., Conforti, R., Rosa, M.L., ter Hofstede, A.H.M.: The 4C spectrum of fundamental behavioral relations for concurrent systems. In: Petri Nets. LNCS, vol. 8489, pp. 210–232. Springer, New York (2014)
Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223–231 (1978)
Reutenauer, C.: The Mathematics of Petri Nets. Prentice-Hall, Inc., Upper Saddle River, NJ (1990)
Schmidt, K.: LoLA: A low level analyser. In: Application and Theory of Petri Nets (ICATPN). Lecture Notes in Computer Science, vol. 1825, pp. 465–474. Springer, New York (2000)
van der Aalst, W.M.P.: Formalization and verification of event-driven process chains. Inf. Softw. Technol. 41(10), 639–650 (1999)
van der Aalst, W.M.P.: Process Mining—Data Science in Action, 2nd edn. Springer, New York (2016)
van der Aalst, W.M.P., Adriansyah, A., van Dongen, B.F.: Replaying history on process models for conformance checking and performance analysis. Data Min. Knowl. Discov. 2(2), 182–192 (2012). https://doi.org/10.1002/widm.1045
Wolf, K.: Interleaving based model checking of concurrency and causality. Fund. Inf. 161(4), 423–445 (2018). https://doi.org/10.3233/FI-2018-1709
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Polyvyanyy, A. (2022). Process Query Language. In: Polyvyanyy, A. (eds) Process Querying Methods. Springer, Cham. https://doi.org/10.1007/978-3-030-92875-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-92875-9_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92874-2
Online ISBN: 978-3-030-92875-9
eBook Packages: Computer ScienceComputer Science (R0)