메뉴 건너뛰기




Volumn 15, Issue 1, 2009, Pages 74-92

Business process verification - Finally a reality!

Author keywords

Business process re engineering; Modelling; Programming languages

Indexed keywords


EID: 59349105887     PISSN: 14637154     EISSN: None     Source Type: Journal    
DOI: 10.1108/14637150910931479     Document Type: Article
Times cited : (112)

References (29)
  • 2
    • 23044464564 scopus 로고    scopus 로고
    • Applying propositional logic to workflow verification
    • Bi, H., Zhao, J. Applying propositional logic to workflow verification Information Technology and Management 5 3-4 2004 293-318
    • (2004) Information Technology and Management , vol.5 , Issue.34 , pp. 293-318
    • Bi, H.1    Zhao, J.2
  • 3
    • 33646170278 scopus 로고    scopus 로고
    • Decomposition-based verification of cyclic workflows
    • Peled, D., Tsay, Y.-K. Springer-Verlag Taipei Vol. 3707 of Lecture Notes in Computer Science
    • Choi, Y., Zhao, J. Peled, D., Tsay, Y.-K. Decomposition-based verification of cyclic workflows Proceedings of Automated Technology for Verification and Analysis (ATVA 2005) Springer-Verlag Taipei 2005 84-98 Vol. 3707 of Lecture Notes in Computer Science
    • (2005) Proceedings of Automated Technology for Verification and Analysis (ATVA 2005) , pp. 84-98
    • Choi, Y.1    Zhao, J.2
  • 5
    • 0003947126 scopus 로고
    • Cambridge University Press Cambridge Vol. 40 of Cambridge Tracts in Theoretical Computer Science
    • Desel, J., Esparza, J. Free Choice Petri Nets Cambridge University Press Cambridge 1995 Vol. 40 of Cambridge Tracts in Theoretical Computer Science
    • (1995) Free Choice Petri Nets
    • Desel, J.1    Esparza, J.2
  • 6
    • 84878552622 scopus 로고    scopus 로고
    • Reset nets between decidability and undecidability
    • Larsen, K., Skyum, S., Winskel, G. Springer-Verlag Aalborg Vol. 1443 of Lecture Notes in Computer Science
    • Dufourd, C., Finkel, A., Schnoebelen, P. Larsen, K., Skyum, S., Winskel, G. Reset nets between decidability and undecidability Proceedings of the 25th International Colloquium on Automata, Languages and Programming 1443 Springer-Verlag Aalborg 1998 103-15 Vol. 1443 of Lecture Notes in Computer Science
    • (1998) Proceedings of the 25th International Colloquium on Automata, Languages and Programming , vol.1443 , pp. 103-15
    • Dufourd, C.1    Finkel, A.2    Schnoebelen, P.3
  • 7
    • 84887436670 scopus 로고    scopus 로고
    • Boundedness of reset P/T nets
    • Wiedermann, J., Boas, P., Nielsen, M. Springer-Verlag Prague, Czech Republic Vol. 1644 of Lecture Notes in Computer Science
    • Dufourd, C., Jaňcar, P., Schnoebelen, P. Wiedermann, J., Boas, P., Nielsen, M. Boundedness of reset P/T nets Lectures on Concurrency and Petri Nets Springer-Verlag Prague, Czech Republic 1999 301-10 Vol. 1644 of Lecture Notes in Computer Science
    • (1999) Lectures on Concurrency and Petri Nets , pp. 301-10
    • Dufourd, C.1    Jaňcar, P.2    Schnoebelen, P.3
  • 8
    • 0034911369 scopus 로고    scopus 로고
    • Well-structured transition systems everywhere!
    • Finkel, A., Schnoebelen, P. Well-structured transition systems everywhere! Theoretical Computer Science 256 1-2 2001 63-92
    • (2001) Theoretical Computer Science , vol.256 , Issue.12 , pp. 63-92
    • Finkel, A.1    Schnoebelen, P.2
  • 9
    • 67650672862 scopus 로고    scopus 로고
    • Generalised soundness of workflow nets is decidable
    • Cortadella, J., Reisig, W. Springer-Verlag New York, NY Vol. 3099 of Lecture Notes in Computer Science
    • Hee, K., Sidorova, N., Voorhoeve, M. Cortadella, J., Reisig, W. Generalised soundness of workflow nets is decidable Application and Theory of Petri Nets 2004 Springer-Verlag New York, NY 2004 Vol. 3099 of Lecture Notes in Computer Science
    • (2004) Application and Theory of Petri Nets 2004
    • Hee, K.1    Sidorova, N.2    Voorhoeve, M.3
  • 10
    • 23044520720 scopus 로고    scopus 로고
    • Inter-operability of workflow applications: Local criteria for global soundness
    • van der Aalst, W., Desel, J., Oberweis, A. Springer-Verlag Berlin Vol. 1806 of Lecture Notes in Computer Science
    • Kindler, E., Martens, A., Reisig, W. van der Aalst, W., Desel, J., Oberweis, A. Inter-operability of workflow applications: local criteria for global soundness Business Process Management: Models, Techniques, and Empirical Studies Springer-Verlag Berlin 2000 235-53 Vol. 1806 of Lecture Notes in Computer Science
    • (2000) Business Process Management: Models, Techniques, and Empirical Studies , pp. 235-53
    • Kindler, E.1    Martens, A.2    Reisig, W.3
  • 11
    • 33750016320 scopus 로고    scopus 로고
    • Dustdar, S., Faideiro, J., Sheth, A. Springer-Verlag International Conference on Business Process Management (BPM 2006), Vol. 4102 of Lecture Notes in Computer Science
    • Mendling, J., Moser, M., Neumann, G., Verbeek, H., Dongen, B., van der Aalst, W. Dustdar, S., Faideiro, J., Sheth, A. Faulty EPCs in the SAP reference model Springer-Verlag 2006 451-7 International Conference on Business Process Management (BPM 2006), Vol. 4102 of Lecture Notes in Computer Science
    • (2006) Faulty EPCs in the SAP Reference Model , pp. 451-7
    • Mendling, J.1    Moser, M.2    Neumann, G.3    Verbeek, H.4    Dongen, B.5    Van Der Aalst, W.6
  • 12
    • 0024645936 scopus 로고
    • Petri nets: Properties, analysis and applications
    • Murata, T. Petri nets: properties, analysis and applications Proceedings of the IEEE 77 4 1989 541-80
    • (1989) Proceedings of the IEEE , vol.77 , Issue.4 , pp. 541-80
    • Murata, T.1
  • 14
    • 84958977057 scopus 로고    scopus 로고
    • Applying graph reduction techniques for identifying structural conflicts in process models
    • Jarke, M., Oberweis, A. Springer-Verlag Heidelberg Vol. 1626 of Lecture Notes in Computer Science
    • Sadiq, W., Orlowska, M. Jarke, M., Oberweis, A. Applying graph reduction techniques for identifying structural conflicts in process models Proceedings of the 11th Conference on Advanced Information Systems Engineering (CAiSE 1999) Springer-Verlag Heidelberg 1999 195-209 Vol. 1626 of Lecture Notes in Computer Science
    • (1999) Proceedings of the 11th Conference on Advanced Information Systems Engineering (CAiSE 1999) , pp. 195-209
    • Sadiq, W.1    Orlowska, M.2
  • 15
    • 0030488164 scopus 로고    scopus 로고
    • Reduction rules for time Petri nets
    • Sloan, R., Buy, U. Reduction rules for time Petri nets Acta Informatica 33 7 1996 687-706
    • (1996) Acta Informatica , vol.33 , Issue.7 , pp. 687-706
    • Sloan, R.1    Buy, U.2
  • 16
    • 52449135365 scopus 로고    scopus 로고
    • Verification of workflow nets
    • Azçema, P., Balbo, G. Vol. 1248 of Lecture Notes in Computer Science Toulouse Springer-Verlag
    • van der Aalst, W. Azçema, P., Balbo, G. Verification of workflow nets Proceedings of Application and Theory of Petri Nets Springer-Verlag Toulouse 1997 407-26 Vol. 1248 of Lecture Notes in Computer Science
    • (1997) Proceedings of Application and Theory of Petri Nets , pp. 407-26
    • Van Der Aalst, W.1
  • 18
    • 0002307971 scopus 로고    scopus 로고
    • Workflow verification: Finding control-flow errors using Petri net-based techniques
    • van der Aalst, W., Desel, J., Oberweis, A. Springer-Verlag Berlin Vol. 1806 of Lecture Notes in Computer Science
    • van der Aalst, W. van der Aalst, W., Desel, J., Oberweis, A. Workflow verification: finding control-flow errors using Petri net-based techniques Proceedings of Business Process Management: Models, Techniques and Empirical Studies Springer-Verlag Berlin 2000 161-83 Vol. 1806 of Lecture Notes in Computer Science
    • (2000) Proceedings of Business Process Management: Models, Techniques and Empirical Studies , pp. 161-83
    • Van Der Aalst, W.1
  • 23
    • 27144459946 scopus 로고    scopus 로고
    • Eindhoven University of Technology Eindhoven
    • Verbeek, H. Verification of WF-nets Eindhoven University of Technology Eindhoven 2004
    • (2004) Verification of WF-nets
    • Verbeek, H.1
  • 25
    • 36049051847 scopus 로고    scopus 로고
    • Verifying workflows with cancellation regions and OR-joins: An approach based on relaxed soundness and invariants
    • Verbeek, H., van der Aalst, W., ter Hofstede, A. Verifying workflows with cancellation regions and OR-joins: an approach based on relaxed soundness and invariants The Computer Journal 50 3 2006 294-314
    • (2006) The Computer Journal , vol.50 , Issue.3 , pp. 294-314
    • Verbeek, H.1    Van Der Aalst, W.2    Ter Hofstede, A.3
  • 27
    • 26444598543 scopus 로고    scopus 로고
    • Achieving a general, formal and decidable approach to the OR-join in workflow using reset nets
    • Ciardo, G., Darondeau, P. Springer-Verlag Miami Vol. 3536 of Lecture Notes in Computer Science
    • Wynn, M., Edmond, D., van der Aalst, W., ter Hofstede, A. Ciardo, G., Darondeau, P. Achieving a general, formal and decidable approach to the OR-join in workflow using reset nets Proceedings of ATPN Springer-Verlag Miami 2005 423-43 Vol. 3536 of Lecture Notes in Computer Science
    • (2005) Proceedings of ATPN , pp. 423-43
    • Wynn, M.1    Edmond, D.2    Van Der Aalst, W.3    Ter Hofstede, A.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.