On the Complexity of Some Verification Problems in Process Control Specifications

Computer Journal

Volumn 42, Issue 5, 1999, Pages 349-359

  Ter Hofstede, A H M ^a   Orlowska, M E ^b  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000897950     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/42.5.349     Document Type: Article

References (28)

1. Bots, P. W. G. (1987) An environment to support problem solving. Decision Support Systems, 3, 225-231.
2. Dur, R. C. J. and Bots, P. W. G. (1991) Dynamic modelling of organizations using task/actor simulation. In Crosslin, R. L. and Sol, H. G. (eds), Proc. 2nd Int. Working Conf. on Dynamic Modelling of Information Systems, pp. 49-71. Elsevier Science Publishers, Amsterdam, The Netherlands.
3. Osterweil, L. (1987) Software processes are software too. In Proc. 9th Int. Conf. on Software Engineering, Monterey, CA, pp. 2-13. ACM Press, New York, NY.
4. Curtis, B., Keller, M. I. and Over, J. (1992) Process modelling. Commun. ACM, 35, 75-90.
5. Gulla, J. A., Lindland, O. I. and Willumsen, G. (1991) PPP: An integrated CASE environment. In Andersen, R., Bubenko, J. A. and Sølvberg, A. (eds), Proc. 3rd Int. Conf. CAiSE'91 on Advanced Information Systems Engineering (Lecture Notes in Computer Science vol. 498), Trondheim, Norway, May, pp. 194-221. Springer-Verlag, Berlin.
6. Kristen, G. (1994) Object Orientation, the KISS Method: From Information Architecture to Information System. Addison-Wesley, Reading, MA.
7. Jacobson, I., Christerson, M., Jonsson, M. and van Overgaard, P. (1992) OO Software Engineering, A Use Case Driven Approach. Addison-Wesley, Reading, MA.
8. Wijers, G. M. and Heijes, H. (1990) Automated support of the modelling process: a view based on experiments with expert information engineers. In Steinholz, B., Sølvberg, A. and Bergman, L. (eds), Proc. 2nd Nordic Conf. CAiSE'90 on Advanced Information Systems Engineering (Lecture Notes in Computer Science vol. 436), Stockholm, Sweden, pp. 88-108. Springer-Verlag, Berlin.
9. Marttiin, P. (1994) Towards flexible process support with a CASE shell. In Wijers, G., Brinkkemper, S. and Wasserman, I. (eds), Proc. 6th International Conf. CAiSE'94 on Advanced Information Systems Engineering (Lecture Notes in Computer Science vol. 811), Utrecht, The Netherlands, June, pp. 14-27. Springer-Verlag, Berlin.
10. Casati, F., Ceri, S., Pernici, B. and Pozzi, G. (1995) Conceptual modeling of workflows. In Papazoglou, M. P. (ed.), Proc. OOER'95, 14th International Object-Oriented and Entity-Relationship Modelling Conf. (Lecture Notes in Computer Science vol. 1021), December, pp. 341-354. Springer-Verlag, Berlin.
11. ter Hofstede, A. H. M., Orlowska, M. E. and Rajapakse, J. (1998) Verification problems in conceptual workflow specifications. Data Knowledge Eng., 24, 239-256.
12. Baeten, J. C. M. and Weijland, W. P. (1990) Process Algebra. Cambridge University Press, Cambridge.
13. ter Hofstede, A. H. M. and Nieuwland, E. R. (1993) Task structure semantics through process algebra. Software Eng. J., 8, 14-20.
14. Milner, R. (1989) Communication and Concurrency. Prentice-Hall, Englewood Cliffs, NJ.
15. Hoare, C. A. R. (1985) Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, NJ.
16. van Glabbeek, R. J. and Weijland, W. P. (1996) Branching time and abstraction in bisimulation semantics. J. ACM, 43, 555-600.
17. Milne, G. J. (1985) CIRCAL and the representation of communication, concurrency and time. ACM TOPLAS, 7, 270-298.
18. Peterson, J. L. (1981) Petri Net Theory and the Modelling of Systems. Prentice-Hall, Englewood Cliffs, NJ.
19. Jones, N. D., Landweber, L. H. and Lien, Y. E. (1977) Complexity of some problems in Petri Nets. Theor. Comput. Sci., 4, 277-299.
20. Mayr, E. W. (1984) An algorithm for the general Petri Net reachability problem. SIAM J. Comput., 13, 441-460.
21. Cheng, A., Esparza, J. and Palsberg, J. (1995) Complexity results for 1-safe nets. Theor. Comput. Sci., 147, 117-136.
22. van Glabbeek, R. J. (1990) The linear time-branching time spectrum. In Baeten, J. C. M. and Klop, J. W. (eds), Proc. CONCUR'90. Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, pp. 278-297. Springer-Verlag, Berlin.
23. Wijers, G. M., ter Hofstede, A. H. M. and van Oosterom, N. E. (1992) Representation of information modelling knowledge. In Tahvanainen, V.-P. and Lyytinen, K. (eds), Next Generation CASE Tools, Studies in Computer and Communication Systems vol. 3, pp. 167-223. IOS Press, Amsterdam, The Netherlands.
24. Bots, P. W. G. (1989) An Environment to Support Problem Solving. PhD Thesis, Delft University of Technology, Delft, The Netherlands.
25. Salomaa, A. (1973) Formal Languages (ACM Monograph Series). Academic Press, New York, NY.
26. Groote, J. F. and Hüttel, H. (1994) Undecidable equivalences for BPA. Information and Computation, 115, 354-371.
27. Christensen, S., Hirshfeld, Y. and Moller, F. (1994) Decidable subsets of CCS. Comput. J., 37, 233-242.
28. Esparza, J. (1998) Decidability and complexity of Petri Net problems - an introduction. In Rozenberg, G. and Reisig, W. (eds), Advances in Petri Nets. Lectures on Petri Nets I: Basic Models (Lecture Notes in Computer Science vol. 1491), pp. 374-428. Springer-Verlag, Berlin.