Property-preserving petri net process algebra: In software engineering

Property-Preserving Petri Net Process Algebra: In Software Engineering

Volumn , Issue , 2012, Pages 1-306

  Huang, Hejiao ^a   Jiao, Li ^b   Cheung, To Yat ^c   Mak, Wai Ming ^d  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^d HSBC Software Development (Guangdong) Limited   (China)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; SOFTWARE ENGINEERING;

BASIC SYSTEMS; COMPONENT BASED; COMPONENT BASED APPROACH; DESIGN SPECIFICATION; NEW COMPONENTS; PROCESS ALGEBRAS; PROPERTY-PRESERVING;

ALGEBRA;

EID: 84995390402     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/7919     Document Type: Book

References (182)

1. P. Allen and S. Frost. Component-Based, Development for Enterprise Systems: Applying Select Approach. Cambridge University Press.
2. C. Szyperski. Component Software - Beyond Object-Oriented Programming. Addison-Wesley.
3. C. Szyperski. “Component software and the way ahead”, Foundations of Component-Based Systems. In: Foundations of component-based systems, G.T. Leavens and M. Sitaraman (Eds), Cambridge University Press, pp. 1-20.
4. T. Bolognesi and E. Brinksma. “Introduction to the ISO specification language LOTOS”. Computer Networks and ISDN Systems, Vol. 14, Issue.1, pp. 25-59.
5. L. Logrippo, M. Faci and M. Haj-Hussein. “An introduction to LOTOS: learning by examples”. Computer Networks and ISDN Systems, Vol. 23, Issue 5, 1992, pp. 325-342.
6. R. Janicki and P. E. Lauer. Specification and analysis of concurrent systems: the COSY approach, Springer-Verlag, 1992.
7. E. Best, R. Devillers and M. Koutny. Petri net algebra. SpringerVerlag, Berlin, 2001.
8. T.Y. Cheung and X. Zhu. “A formal-method approach for cyclo-matic complexity of distributed software”. Trans. of K. C. Wong Education Foundation Supported Lectures, K.C. Wong Education Foundation, 1994, pp. 99-118.
9. T.Y. Cheung, S.Y. Ren and W.M. Mak. “A tool for accessing the quality of distributed software designs specified in LOTOS”. Proc. 5th Annual Working Conference of Southeast Asian Regional Computer Confederation - Software Engineering Education, 1994, pp. 31-44.
10. J. Desel. “Place/Transition Petri nets”. Advances in Petri Nets, LNCS 1491, Springer-Verlag, 1998, pp. 122-173.
11. J. Desel. “Linear algebraic techniques for place/transition nets”. Advances in Petri Nets, LNCS 1491, Springer-Verlag, 1998, pp. 257-308.
12. W. Reisig. Petri Nets - An Introduction. Springer-Verlag, 1985.
13. T. Murata. “Petri nets: Properties, analysis and applications”. Proceedings of the IEEE, Vol. 77, No. 4, 1989, pp. 541-580.
14. M. Silva, E. Teruel, R. Valette and H. Pingaud. “Petri nets and production systems”. Advances in Petri Nets, LNCS 1492, Springer-Verlag, 1998, pp. 85-124.
15. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.
16. E. Best. “Structure theory of Petri nets: the free choice hiatus”. Advances in Petri Nets, LNCS 254, Springer-Verlag, 1987, pp. 168-206.
17. J. Campos, G. Chiola and M. Silva. “Properties and performance bounds for closed free choice synchronized monoclass queueing networks”. IEEE Transaction on Automatic Control, Vol. 36, No. 12, 1991, pp. 1368-1381.
18. J. Esparza. “Synthesis rules for Petri nets, and how they lead to new results”. CONCUR 1990, LNCS 458, Springer-Verlag, 1990, pp. 182-198.
19. J. Desel. “A proof of rank theorem for extended free choice nets”. ICATPN 1992, LNCS 616, Springer-Verlag, 1992, pp. 134-153.
20. J. Desel“Regular marked Petri nets”. Graph-Theoretic Concepts in Computer Science 1993, LNCS 790, Springer-Verlag, 1993, pp. 264-275.
21. E. Teruel and M. Silva. “Well-formedness of equal conflict systems”. ICATPN 1994, LNCS 815, Springer-Verlag, 1994, pp. 491-510.
22. E. Teruel and M. Silva. “Structure theory of equal conflict systems”. Theoretical Computer Science, Vol. 153, No. 1-2, 1996, pp. 271-300.
23. L. Recalde, E. Teruei and M. Silva. “One well-formedness analysis: the case of deterministic systems of sequential processes”. Structure in Concurrency Theory 1995, Workshops in Computing, Springer, 1995, pp. 279-293.
24. L. Recalde, E. Teruei and M. Silva. “{SC}*ECS: A class of modular and hierarchical cooperating systems”. ICATPN 1996, LNCS 1091, Springer-Verlag, 1996, pp. 440-459.
25. M. Sliva, E. Teruel and J.M. Colom. “Linear algebraic and linear programming techniques for the analysis of place/transition net systems”. Advances in Petri Nets 1998, LNCS 1491, Springer-Verlag, 1998, pp. 309-373.
26. L. Jiao, T.Y. Cheung and W.M. Lu. “Characterizing liveness of Petri nets in terms of siphons”. ICATPN 2002, LNCS 2360, Springer-Verlag, 2002, pp. 203-216.
27. F. Chu and X. Xie. “Deadlock analysis of Petri nets using siphons and mathematical programming”. IEEE Transactions on Robotics and Automation, Vol. 13, No. 6, 1997, pp. 793-804.
28. A. A. Desrochers and R. Y. AI-Jaar. Applications of Petri Nets in Manufacturing Systems: Modeling, Control and Performance Analysis. IEEE Press, 1995.
29. H. Huang, L. Jiao and T. Y. Cheung. “Property-preserving composition of augmented marked graphs that share common resources”. Proc. IEEE International Conference on Robotics and Automation, IEEE. 2003, pp. 1446-1451.
30. K.S. Cheung. “Use-case-driven system design: a synthesis methodology based on labelled Petri nets”. PhD thesis, Dept. of Computer Science, City University of Hong Kong, 2002.
31. W.M. Mak. “Verifying property preservation for component-based software systems (a Petri-net based methodology)”. PhD Thesis, Dept. of Computer Science, City University of Hong Kong, 2001.
32. R. Valette. “Analysis of Petri nets by stepwise refinements”. Journal of Computer and System Sciences, Vol. 18, Issue 1, 1979, pp. 35-46.
33. J. Bruno and S.M. Altman. “A theory of asynchronous control net-works”. IEEE Transactions on Computing, Vol. C-20, Issue 6, 1971, pp. 629-638.
34. T. Murata and J. Y. Koh. “Reduction and expansion of live and safe marked graphs”. IEEE Trans. on Circuits and Systems, Vol. 27, Issue 1, 1980, pp. 68-70.
35. I. Suzuki and T. Murata. “A method for stepwise refinement and abstraction of Petri nets”. Journal of Computer and System Sciences, Vol. 27, Issue 1, 1983, pp. 51-76.
36. W. Vogler. “Behavior preserving refinement of Petri nets”. Graph-Theoretic Concepts in Computer Sciences, LNCS 246, Springer-Verlag, 1987, pp. 82-93.
37. L. Bernardinello and F. de Cindio. “A survey of basic net models and modular net classes”. Advances in Petri nets 1992, LNCS 609, SpringerVerlag, 1992, pp. 304-351.
38. K. Muller. “Constructible Petri nets”, Elerktr. Inf. Kybern. 21, 1985.
39. W. M. P. Van der Aalst. “Verification of workfolk nets”. ICATPN 1997, LNCS 1248, Springer-Verlag, 1997, pp. 407-426.
40. W. M. P. Van der Aalst “The application of Petri nets to workfolk management”. Journal of Circuits, Systems and Computers, Vol. 8, No. 1, 1998, pp. 21-66.
41. M. Hennessy. “Axiomatizing finite concurrent process es”. Technical Report 4/87, Dept. Sci. Univ. of Sussex, Brighon, 1987.
42. L. Aceto and M. Hennesy. “Towards action-refinement in process algebras”. Technical Report 3/88, Dept. Sci. Univ. of Sussex, Brighon, 1988.
43. M. Nielsen, U. Engberg and K. Larsen. “Fully abstract models for a process language with refinement”. Proc. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency 1988, LNCS 354, Springer-Verlag, 1988, pp. 523-548.
44. L. Aceto. “Full abstractions for series-parallel pomsets”. Technical Report 1/90, Dept. Sci. Univ. of Sussex, Brighon, 1990.
45. M. Nielsen, G. D. Plotkin and G. Winskel. “Petri nets, event structures and domains, part I”. Theory of Computer Science, Vol. 13, Issue. 1, 1981, pp. 85-108.
46. R. J. Glabbeek and U. Goltz. “Equivalence notions for concurrent systems and refinement of actions”. Mathematical Foundations of Computer Science 1989, LNCS 379, Springer-Verlag, 1989, pp. 237-248.
47. R. J. Glabbeek and W. P. Weijland. “Refinement in branching time semantics”. Technical Report CS-R8922, CWI, Amsterdam, 1989.
48. R. J. Glabbeek and U. Goltz. “Equivalences and Refinement”. Semantics of Systems of Concurrent Processes 1990, LNCS 469, SpringerVerlag, 1990, pp. 309-333.
49. R. J. Glabbeek and U. Goltz.“Refinement of actions in causality based models”. Technical Report, Arbeitspapiere der GMD 428, 1990.
50. W. Vogler. “Bisimulation and action refinement”. Technical Report SFB-Bericht Nr. 342/10/90A, Inst.Informatik, Techn. Univ. Munchen, 1990.
51. R. J. Glabbeek and F. Vaandrager. “Petri net models for algebraic theories of concurrency”. PARLE Parallel Architectures and Languages Europe 1987, LNCS 259, Springer-Verlag, 1987, pp. 224-242.
52. R. Devillers. “On the definition of a bisimulation notion based on partial words”. Petri net newsletter 29, 1988, pp. 16-19.
53. E. Best, R. Devillers, A. Kiehn and L. Pomello. “Fully concurrent bisimulation”, Technical Report LIT-202, Univ.Bruxelles, 1989
54. W. Vogler. “Failure semantics based on interval semiwords is a conguence for refinement”. Distributed Computering, Vol. 4, No.3, 1990, pp. 139-162.
55. H. Huang, T.Y. Cheung and W. M. Mak. “Structure and Behavior Preservation by Petri-net-based Refinements in System Design”. Theoretical Computer Science, Vol. 328, Issue 3, 2004, pp. 245-269.
56. L. Jiao. “Refining and Verifying Regular Petri Nets”. International Journal of System Sciences, Vol. 39, No. 1, 2008, pp. 17-27.
57. V. Pratt. “Modeling concurrency with partial orders”. International Journal of Parallel Programming, Vol.15, No. 1, 1986, pp. 33-71.
58. L. Castellano, G. De Michelis and L. Pomello. “Concurrency vs. interleaving: an instructive example”. Bull. EATCS 31, 1987, pp. 12-15.
59. G. Berthelot. “Checking properties of nets using transformations”. Advances in Petri Nets 1985, LNCS 222, Springer-Verlag, 1985, pp. 19-40.
60. R. J. Lipton. “Reduction: a method of proving properties of parallel programs”. Journal of ACM, Vol. 3, No.12, 1981, pp. 561-567.
61. Y. S. Kwong. “On reduction of asynchronous systems”. Theoretical Computer Science, Vol. 5, Issue 1, 1977, pp. 25-50.
62. W. Kowalk and R. Valk. “On reduction of parallel programs”. ICALP 1979, LNCS 71, Springer-Verlag, 1979, pp. 356-369.
63. G. Berthelot. “Transformations and decompositions of nets”. Advances in Petri Nets 1986, LNCS 254, Springer-Verlag, 1987, pp. 359-376.
64. K.H. Lee and J. Favrel. “Hierarchical reduction method for analysis and decomposition of Petri nets”. IEEE Trans. on Systems, Man and, Cybernetics, Vol. 15, No. 2, 1985, pp. 272-280.
65. K.H. Lee, J. Favrel and P. Baptiste. “Generalized Petri net reduction method”. IEEE Trans. on Systems, Man and Cybernetics, Vol. 17, No. 2, 1987, pp. 297-303.
66. J. Desel. “Reduction and design of well-behaved concurrent systems”. CONCUR 1990, LNCS 458, Springer-Verlag, 1990, pp. 166-181.
67. J. Esparza. “Reduction and synthesis of live and bounded free choice Petri nets”. Information and Computation, Vol. 114, Issue 1, 1994, pp. 50-87.
68. J. Esparza and M. Silva. “On the analysis and synthesis of free choice Petri nets”. Advances in Petri Nets 1990, LNCS 483, Springer-Verlag, 1990, pp. 241-286.
69. J. Esparza and M. Silva. “Compositional synthesis of live and bounded free choice Petri nets”. CONCUR 1991, LNCS 527, SpringerVerlag, 1991, pp. 173-187.
70. L. Jiao, T.Y. Cheung and W.M. Lu. “On liveness and boundedness of asymmetric choice nets”. Theoretical Computer Science, Vol. 311, Issue 1-3, 2004, pp. 165-197.
71. J. M. Proth and X. Xie. Petri Net: A Tool for Design and Management of Manufacturing Systems. Chichester, New York, Wiley, 1996.
72. R. H. Sloan and U. Buy. “Reduction rules for time Petri nets”. Acta Information, Vol. 33, No. 5, 1996, pp. 687-706.
73. J. Wang and W. Deng. “Component-level reduction rules for time Petri nets with application in C2 systems”. Proc. IEEE International Conference on Systems, Man and Cybernetics 1998, 1998, pp. 11-14.
74. T. Agerwala and Y. Choed-Amphai. “A synthesis rule for concurrent systems”. DAC 1978, IEEE Press, 1978, pp. 305-311.
75. Y. Souissi and G. Memmi. “Composition of nets via a communication medium”. Advances in Petri Nets 1990, LNCS 483, Springer-Verlag, 1990, pp. 457-470.
76. Y. Narahari and N. Viswanadham. “A Petri net approach to the modeling and analysis of flexible manufacturing systems”. Annals of Operations Research, Vol. 3, No. 8, 1985, pp. 449-472.
77. H. Huang, L. Jiao and T.Y. Cheung. “Property-Preserving Subnet Reductions for Designing Manufacturing Systems with Shared Resources”. Theoretical Computer Science Vol. 332, Issue 1-3, 2005, pp. 461-485.
78. L. Jiao, H. Huang and T.Y Cheung. “Property-preserving Composition by Place Merging”. Journal of Circuits, Systems and Computers, Vol. 14, No. 4, 2005, pp. 793-812.
79. L. Jiao, H. Huang and T.Y Cheung. “Handling Resource Sharing Problem Using Property-Preserving Place Fusions of Petri Nets”. Journal of Circuits, Systems, and Computers, Vol.17, No. 3, 2008, pp. 365-387.
80. M. Zhou. “Generalizing parallel and sequential mutual exclusions for Petri net synthesis of manufacturing systems”. IEEE Int. Conf. On Emerging Technologies and Factory Automation 1996, IEEE, Vol. 1, 1996, pp. 49-55.
81. M. Zhou and K. Venkatesh. Modeling, Simulation, and Control of Flexible Manufacturing Systems: a Petri Net Approach. World Scientific Publishing Co. Pte. Ltd, 1999.
82. C. L. Beck. “Modeling and simulation of flexible control structures for automated manufacturing systems”. M.S thesis and Robotics Inst. Tech. Rep., Carnegie-Mellon Univ. Pittsburgh, PA, 1985.
83. B.H. Krogh and C.L. Beck. “Synthesis of place/transition nets for simulation and control of manufacturing systems”. Proc. IFIP Symposium on Large Scale Systems 1986, 1986, pp. 661-666.
84. I. Koh and F. Di Cesare. “Modular transformation methods for generalized Petri nets and their applications to automated manufacturing systems”. IEEE Trans. on Systems, Man and Cybernetics, Vol. 21, Issue 6, 1991, pp. 1512-1522.
85. M.D. Jeng and F. Di Ceasare. “Synthesis using resource control nets for modeling shared-resource systems”. IEEE Trans. on Robotics and Automation, Vol. 11, No. 3, 1995, pp. 317-327.
86. M.D. Jeng. “A Petri net synthesis theory for modeling flexible manufacturing systems”. IEEE Trans. on Systems, Man and Cybernetics -Part B: Cybernetics, Vol. 27, No. 2, 1997, pp. 169-183.
87. J.M. Proth, L. Wang and X. Xie. “A class of Petri nets for manufacturing system integration”. IEEE Trans. on Robotics and Automation, Vol. 13, No. 3, 1997, pp. 317-326.
88. E. Kindler. “A compositional partial order semantics for Petri net components”. ICATPN 1997, LNCS 1248, Springer-Verlag, 1997, pp. 235-252.
89. R. S. Pressman. Software Engineering, A practioner’s Approach. McGraw- Hill, fourth edition, 1997.
90. W. M. P. Van der Aalst. “Workflow verification: Finding control-flow errors using Petri-net-based techniques”. Business Process Management 2000, LNCS 1806, Springer-Verlag, 2000, pp. 161-183.
91. D. Pape, C. Cruz-Neira and M. Czernuszenko. CAVE user’s guide, Electronic Visualization Laboratory, University of Illinois at Chigago, May,1997.
92. th International Conference on Application and Theory of Petri Nets, Williamsburg, VA, USA, 1999.
93. M.C. Zhou and F. Di Cesare. Petri Net Synthesis for Discrete Event Control of Manufacturing Systems. Kluwer Academic Publishers, 1993.
94. K. Barkaoui, J. M. Couvreur and C. Dutheillet. “On liveness in extended non self-controlling nets”. ICATPN 1995, LNCS 935, SpringerVerlag, 1995, pp. 25-44.
95. K. S. Valvanis. “On the hierarchical analysis and simulation of flexible manufacturing systems with extended Petri nets”. IEEE Trans. on System, Man, and Cybernetics, Vol. 20, Issue 1, 1990, pp. 94-100.
96. H. Xu and S. M. Shatz. “A framework for model-based design of agent-oriented software”. IEEE Trans. on Software Engineering, Vol. 29, No. 1, 2003, pp. 15-30.
97. J. M. Colom. “The resource allocation problem in flexible manufacturing systems”. ICATPN 2003, LNCS 2679, Springer-Verlag, 2003, pp. 23-35.
98. S.A. Reveliotis. “Accommodating FMS operational contingencies through routing flexibility”. Proc. IEEE Int. Conf. On Robotics and Automation 1998, 1998, pp. 573-579.
99. Y. Souissi. “On liveness preservation by composition of nets via a set of places”. Advances in Petri Nets 1991, LNCS 524, Springer-Verlag, 1991, pp. 277-295.
100. J. L. Villarroel, J. Martinez and M. Silva. “GRAMAN: a graphic system for manufacturing system design”. Proc. IMACS Int. Symp. Syst. Model &Simul., 1988.
101. J. S. Ahuja and K. P. Valavanis. “A hierarchical modeling methodology for flexible manufacturing systems using extended Petri nets”. Proc. Int. Conf. On Computer Integrated Manufacturing, 1988, pp. 350-356.
102. A. Datta and S. Ghosh. “Synthesis of a class of deadlock-free Petri nets”. Journal of the ACM, Vol. 31, No. 3, 1984, pp. 486-506.
103. G. Goos and J. Hartmanis. “Modular synthesis of deadlock-free control structures”. FSTTCS 1986, LNCS 241, Springer-Verlag, 1986, pp. 288-318.
104. M. Zhou, F. Di Cesare and A. A. Desrochers. “A top-down modular approach to synthesis of Petri net models for manufacturing systems”. Proc. IEEE Int. Conf. Robotics and Automation 1989, 1989, pp. 534-539.
105. C. Girault and R. Valk. Petri Nets for System Engineering - A Guide to Modeling, Verification, and Applications. Springer, 2003.
106. N. Hamerrlain. “Refinement of open Protocols for modeling and analysis of complex interactions in multi-agent systems”. CEEMAS 2003, LNCS 2691, Springer-Verlag, 2003, pp. 423-434.
107. E. Best, R. Devillers and M. Koutny. Petri Net Algebra. Springer,2001.
108. T. Y. Cheung and W. Zeng, “Invariant-preserving transformations for the verification of place/transition systems”. IEEE Transactions on Systems, Man and Cybernetics - Part A: Systems and Humans, Vol. 28, No.1, 1998, pp. 114-121.
109. H. Huang. Enhancing the property-preserving Petri net process algebra for component-based system design (with application to designing multi-agent systems and manufacturing systems). PhD Dissertation, City University of Hong Kong, 2004.
110. W. Brauer, R. Gold and W. Vogler. “A survey of behavior and equivalence preserving refinement of Petri nets”. Advances in Petri nets 1990, LNCS 483, Springer-Verlag, 1990, pp. 1-46.
111. M. D. Jeng and F. De Cesare. “A review of synthesis techniques for Petri nets with application to automated manufacturing Systems”. IEEE Transactions on System, Man, and Cybernetics, Vol. 23, No. 1, 1993, pp. 301-312.
112. H. Huang, T. Cheung, X. Wang X. “Applications of property-preserving algebras to manufacturing system design”. Journal of Information Science and Engineering, Vol. 23, No. 1, 2007, pp. 167-181.
113. L. Cabac, D. Moldt and H. Rolke. “A proposal for structuring Petri net-based agent interaction protocols”. ICATPN 2003, LNCS 2679, Springer-Verlag, 2003, pp. 102-120.
114. M. Kohler, D. Moldt and H. Rolke. “Modeling the structure and behavior of Petri net agents”. ICATPN 2001, LNCS 2075, 2001, pp. 224-241.
115. M. Kohler, D. Moldt and H. Rolke. “Modeling mobility and mobile agents using nets within nets”. ICATPN 2003, LNCS 2679, Springer-Verlag, 2003, pp. 121-139.
116. J. Cuena, Y. Demazeau, A. G. Serrano and J. Treur. Knowledge Engineering and Agent Technology. IOS press, Amsterdam. 2004.
117. D. Kinny, M. Georgeff and A. Rao. “A methodology and modeling technique for systems of BDI agents”. MAAMAW 1996, LNCS 1038, Springer-Verlag, 1996, pp. 56-71.
118. E. A. Kendall, M. T. Malkoun and C. H. Jiang.“A methodology for developing agent based systems”. DAI 1996, LNCS 1087, Springer-Verlag, 1996, pp. 85-99.
119. B. Horling and V. Lesser.“A survey of multi-agent organizational paradigms”. Knowledge Engineering Review, Vol. 19, No. 4, 2005, pp. 281-316.
120. M. Fisher and M. Wooldridge. “On the formal specification and verification of multi-agent systems”. International Journal of Cooperative Information Systems, Vol. 6, No. 1, 1997, pp. 37-65.
121. M. Wooldridge. “Agents and software engineering”. AI*IA Notizie, Vol. 6, No. 3, 1998, pp. 31-37.
122. F. M. T. Brazier, B. M. Dunin-Keplicz, N. R. Jennings and J. Treur. “DESIRE: modeling multi-agent systems in a compositional formal framework”. International Journal of Cooperative Information Systems, Vol. 6, No. 1, 1997, pp. 67-94.
123. F. Cornelissen, C. M. Jonker and J. Treut. “Compositional verification of knowledge-based systems: a case study in diagnostic reasoning”. EKAW 1997, LNCS 1319, Springer-Verlag, 1997, pp. 65-80.
124. C. M. Jonker and J. Treur. “Compositional verification of multi-agent systems: a formal analysis of pro-activeness and reactiveness”. International Journal of Cooperative Information System, Vol. 11, Issue 1-2, 2002, pp. 51-92.
125. T. Miyamoto and S. Kumagai. “A multi-agent net model and the realization of software environment”. ICATPN 1999, LNCS 1639, SpringerVerlag, 1999, pp. 83-92.
126. D. Moldt, F. Wienberg. “Multi-agent-systems based on colored Petri nets”. ICATPN 1997, LNCS 1248, Springer-Verlag, 1997, pp. 82-101.
127. S. Ling and S. W. Loke. “MIP-Nets: A compositional model of multiagent interaction”, CEEMAS 2003, LNCS 2691, Springer-Verlag, 2003, pp. 61-72.
128. D. Xu, R. Volz, T. Ioerger and J. Yen. “Modeling and verifying multi-agent behaviors using Predicate/Transition nets”, SEKE 2002, ACM, 2002, pp. 193-200.
129. D. Xu, J. Yin, Y. Deng and J. Deng. “A formal architecture model for logical agent mobility”, IEEE trans. on Software Engineering, Vol. 29, No. 1, 2003, pp. 31-45.
130. J. Huang, N. R. Jennings and J. Fox. “An agent-based approach to health care management”, Journal of Applied Artificial Intelligence, Vol. 9, No. 4, 1995, pp. 401-420.
131. D. K. Terry. A Petri net-based on-line scheduling system for a general manufacturing job shop, PhD Dissertation, Rensselaer Polytechnic Institute, Troy, New York, 1996.
132. J. M. Proth and I. Minis. “Planning and scheduling based on Petri nets: in Petri nets in flexible and agile automation”. In: Zhou, M. C. (Ed.), Kluwer Academic Publishers, Boston, MA, 1995, pp. 109-148.
133. J. M. Proth and X. Xie. Petri nets: a tool for design and management of manufacturing systems, John Wiley &Sons, 1997.
134. H. H. Xiong and M. Zhou. “Scheduling of semiconductor test facility via Petri nets and hybrid heuristic search”. IEEE Transactions on Semiconductor Manufacturing, Vol. 11, No. 3, 1998, pp. 384-393.
135. H. Shih and T. Sekiguchi. “A timed Petri net and beam search based on-line FMS scheduling systems with routing flexibility”. Proceedings of IEEE International Conference on Robotic and Automation, Sacramento,1991, 2548-2553.
136. D. Y. Lee and F. Di Cesare. “FMS scheduling using Petri nets and heuristic search”. IEEE Transactions on Robotics and Automation, Vol. 10, No. 2, 1994, pp. 123-132.
137. T. H. Sun, C. W. Cheng and L. C. Fu. “A Petri net based approach to modeling and scheduling for an FMS and a case study”. IEEE Transactions on Industrial Electronics, Vol. 41, No. 6, 1994, pp. 593-601.
138. Y. M. Wang, N. F. Xiao and H. L. Yin. “A two-stage genetic algorithm for large size job shop scheduling problems”. The International Journal of Advanced Manufacturing Technology, Vol. 39, No. 7-8, 2008, pp. 813-820.
139. S. Y. Lin, L. C. Fu, T. C. Chiang and Y. S. Shen. “Colored timed Petri net and GA based approach to modeling and scheduling for wafer probe center”. Proceedings of the 2003 IEEE. International Conference on Robotics and Automation 1, 2003, pp. 1434-1439.
140. th IEEE Conference on Decision and Control, 1998, pp. 4346-4347.
141. L. Xue and Y. Hao. “Petri net based scheduling for integrated circuits manufacturing”. ACTC Electronica Sinca, Vol. 29, No.8, 2001, pp. 1064-1067.
142. Y. J. Gua, X. N. Zhang, Y. Cao, R. J. Zhao and T. Q. Lin. “Workshop scheduling based on RCPN and system development on Internet/Intranet”. Mini-micro Systems, Vol. 24, No. 7, 2003, pp. 1285-1288.
143. J. Chen and F. F. Chen. “Performance modeling and evaluation of dynamic tool allocation in flexible manufacturing systems using colored Petri nets:an object-oriented approach”. The International Journal of Advanced Manufacturing Technology, Vol. 21, No. 2, 2003, pp. 98-109.
144. H. Huang. “Component-based design and optimization for jobshop scheduling systems”. International Journal of Advanced Manufacturing Technology, Vol. 45, Issue 9, 2009, pp. 958-967.
145. S. Jajodia, P. Samarati, M. L. Sapino and V. S. Subrahma-nian. “Flexible support for multiple access control policies”. ACM Trans. Database Syst, Vol. 26, No. 2, 2001, pp. 214-260.
146. A. A. E. Kalam, R. E. Baida, P. Balbiani, S. Benferhat, F. Cup-pens, Y. Deswarte, A. Miege, C. Saurel and G. Trouessin. “Organization based access control”. Proceedings of IEEE 4th International Workshop on Policies for Distributed Systems and Networks, 2003, pp. 120-131.
147. T. Moses. “Extensible access control markup language (XACML)”, Version 2.0. Technical report, OASIS, 2005.
148. D. J. Dougherty, C. Kirchner, H. Kirchner and A. Santana de Oliveira. “Modular access control via strategic rewriting”. ESORICS 2007, LNCS 4734, Springer-Verlag, 2007, pp. 578-593.
149. P. A. Bonatti, S. D. C. di Vimercati and P. Samarati. “An algebra for composing access control policies”. ACM Trans. Inf. Syst. Secur. Vol. 5, No. 1, 2002, pp. 1-35.
150. D. Wijesekera and S. Jajodia. “A propositional policy algebra for access control”. ACM Trans. Inf. Syst. Secur. Vol. 6, No. 2, 2003, pp. 286-325.
151. L. Bauer, J. Ligatti and D. Walker. “Composing security policies with polymer”. PLDI 2005, ACM, pp. 305-314.
152. A. J. Lee, J. P. Boyer, L. Olson and C. A. Gunter. “Defeasible security policy composition for web services”. FMSE 2006, ACM, pp. 45-54.
153. G. Bruns, D. S. Dantas and M. Huth. “A simple and expressive semantic framework for policy composition in access control”. FMSE 2007, ACM, 2007, pp. 12-21.
154. A. Santana de Oliveira. “Rewriting-based access control policies”.Electronic Notes in Theoretical Computer Science, Vol. 171, No. 4, 2007, pp. 59-72.
155. A. Santana de Oliveira. “R’e’ecriture et modularit’e pour les politiques de s’ecurit’e”. PhD thesis, UHP Nancy 1, 2008.
156. B. Shafiq, A. Masood, J. Joshi and A. Ghafoor. “A role-based access control policy verification framework for real-time systems”. Proc. of the 10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems, 2005, pp. 13-20.
157. K. H. Mortensen. “Automatic code generation method based on coloured Petri net models applied on an access control system”. ICATPN 2000, LNCS 1825, Springer-Verlag, 2000, pp. 367-386.
158. K. Knorr. “Dynamic access control through Petri net workflows”. Proceedings of 16th Annual Conference on Computer Security Applications 2000, IEEE, pp. 159-167.
159. Z. L. Zhang, F. Hong and J. G. Liao. “Modeling Chinese wall policy using colored Petri nets”. Proceedings of the 6th IEEE International Conference on Computer and Information Technology 2006, IEEE, 2006, pp. 162-162.
160. Z. L. Zhang, F. Hong and H. Xiao. “Verification of strict integrity policy via Petri nets”. Proceedings of the International Conference on Systems and Networks Communication, IEEE, 2006, pp. 23.
161. K. Juszczyszyn. “Verifying enterprise’s mandatory access control policies with coloured Petri nets”. Proceedings of the 12th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises 2003. IEEE, 2003, pp. 184-189.
162. Y. Deng, J. C. Wang, J. Tsai and K. Beznosov. “An approach for modeling and analysis of security system architectures”. IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 5, 2003, pp. 1099-1119.
163. H. Huang and H. Kirchner. “Formal Specification and Verification of Modular Security Policy based on Colored Petri Nets”. To appear in IEEE Transactions on Dependable and Secure Computing.
164. M. C. Tschantz and S. Krishnamurthi. “Towards reasonability properties for access-control policy languages”. ACMAT 2006, ACM, 2006, pp. 160-169.
165. S. Barker and M. Fern’andez. “Term rewriting for access control”. DBSec 2006, LNCS 4127, Springer-Verlag, 2006, pp. 179-193.
166. F. Tiplea, T. Jucan and C. Masalagiu. “Term rewriting systems and Petri nets”. Analele Stiintifice ale Universitatii Al. I. Cuza, Vol. 34, No. 4, 1988, pp. 305-317.
167. R. Verma, M. Rusinowitch and D. Lugiez. “Algorithms and reductions for rewriting problems”. Fundamental Informatics, Vol. 46, No. 3,2001, pp. 257-276.
168. I. Leahu and F. Tiplea. “The confluence property for petri nets and its applications”. Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE, 2006, pp. 430-436.
169. R. Melinte, O. Oanea, I. Olga and F. Tiplea. “The home marking problem and some related concepts”. Acta Cybernetica, Vol. 15, Issue 3, 2002, pp. 104-115.
170. K. L. Xing, X. J. Jin and Y. Feng. “Deadlock avoidance Petri net controller for manufacturing systems with multiple resource service”. Proc. IEEE Conference on Robotics and Automation, IEEE, 2005, pp. 4757-4761.
171. J. K. Lee. “Scheduling analysis with resources share using the transitive matrix based on P-invariant”. Proc. 41st SICE Annual Conference,2002, Vol.2, pp. 1359-1364.
172. Z. Li and M. Zhou. “Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems”. IEEE Transactions on System, Man, and Cybernetics, Vol. 34, Issue 1, 2004, pp. 38-51.
173. H. Hu, Z. Li and A. R. Wang. “On the optimal set of elementary siphons in Petri nets for deadlock control in fms”. Proc. 2006 IEEE International Conference on Networking, Sensing and Control, IEEE, 2006, pp. 244-247.
174. Z. Li and N. Wei. “Deadlock control of flexible manufacturing systems via invariant-controlled elementary siphons of Petri nets”. The International Journal of Advanced Manufacturing Technology, Vol. 33, No. 1, 2007, pp. 24-35.
175. E. Roszkowska. “Supervisory control for deadlock avoidance in compound processes”. IEEE Transactions on System, Man, and Cybernetics, Vol. 34, No. 1, 2004, pp. 52-64.
176. G. Xu and Z. M. Wu. “A kind of deadlock-free scheduling method based on Petri net”. Proc. IEEE HASR’02, IEEE, 2002, pp. 195-200.
177. G. Xu and Z. M. Wu. “Deadlock-free scheduling method using Petri net model analysis and GA search. Proc. 2002 International Conference on Control Application, IEEE, Vol. 2, 2002, pp. 1153-1158.
178. J. Liu, Y. Itoh, I. Miyazawa and T. Sekiguchi, “A research on Petri net properties using transitive matrix”. Proc. IEEE International Conference on System, Man, and Cybernetics, IEEE, 1999, pp. 888-893.
179. Y. J. Song and J. K. LEE. “Deadlock analysis of Petri nets using the transitive matrix”. Proc. 41st SICE Annual Conference, IEEE, 2002, pp. 689-694.
180. S. Kim, S. Lee and J. Lee. “Deadlock analysis of Petri nets based on the resource share places relationship. IMACS multiconference on CESA, 2006, pp. 59-64.
181. J. Lee, “Deadlock find algorithm using the transitive matrix”. Proc. CIE 2004, 2004, pp. 24-26.
182. M. Zhou, H. Chiu and H. Xiong, “Petri net scheduling of FMS using branch and bound method”. Industrial Electronics, Control, and Instrumentation. Proc. 1995 IEEE IECON, 1995, pp. 211-216.