Synthesis of Persistent Systems

详细信息    查看全文

• 作者：Eike Best (17)
  Raymond Devillers (18)
  
• 关键词：Cyclic Behaviour ; Persistency ; Labelled Transition Systems ; Parikh Vectors ; Petri Nets ; Region Theory ; System Synthesis ; Reengineering
• 刊名：Lecture Notes in Computer Science
• 出版年：2014
• 出版时间：2014
• 年：2014
• 卷：8489
• 期：1
• 页码：111-129
• 全文大小：354 KB
• 参考文献：1. Badouel, 脡., Bernardinello, L., Darondeau, P.: Petri Net Synthesis, 330 pages. Springer (in preparation, 2014)
  2. Badouel, 脡., Bernardinello, L., Darondeau, P.: Polynomial Algorithms for the Synthesis of Bounded Nets. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds.) TAPSOFT 1995. LNCS, vol.聽915, pp. 364鈥?78. Springer, Heidelberg (1995)
  3. Badouel, 脡.: Theory of Regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.聽1491, pp. 529鈥?86. Springer, Heidelberg (1998) CrossRef
  4. Best, E., Darondeau, P.: A Decomposition Theorem for Finite Persistent Transition Systems. Acta Informatica聽46, 237鈥?54 (2009) CrossRef
  5. Best, E., Darondeau, P.: Petri Net Distributability. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds.) PSI 2011. LNCS, vol.聽7162, pp. 1鈥?8. Springer, Heidelberg (2012) CrossRef
  6. Best, E., Devillers, R.: Solving LTS with Parikh-unique Cycles. TR 2/14, Dep. Informatik, Carl von Ossietzky Universit盲t Oldenburg, 80 pages (February 2014)
  7. Best, E., Devillers, R.: Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. In: Dediu, A.-H., Mart铆n-Vide, C., Sierra-Rodr铆guez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol.聽8370, pp. 161鈥?72. Springer, Heidelberg (2014) CrossRef
  8. Caillaud, B.: http://www.irisa.fr/s4/tools/synet/
  9. Devillers, R.: plain.c , pure.c , frag.c : Specially tailored programs written in C++
  10. Hack, M.: Analysis of production schemata by Petri nets, M.S. thesis, D.E.E. MIT. Cambridge Mass. Project MAC-TR 94 (1972)
  11. Keller, R.M.: A Fundamental Theorem of Asynchronous Parallel Computation. In: Tse-Yun, F. (ed.) Parallel Processing. LNCS, vol.聽24, pp. 102鈥?12. Springer, Heidelberg (1975) CrossRef
  12. Kondratyev, A., Cortadella, J., Kishinevsky, M., Pastor, E., Roig, O., Yakovlev, A.: Checking Signal Transition Graph Implementability by Symbolic BDD Traversal. In: Proc. European Design and Test Conference, Paris, France, pp. 325鈥?32 (1995)
  13. Lamport, L.: Arbiter-Free Synchronization. Distributed Computing聽16(2/3), 219鈥?37 (2003) CrossRef
  14. Landweber, L.H., Robertson, E.L.: Properties of Conflict-Free and Persistent Petri Nets. J. ACM聽25(3), 352鈥?64 (1978) CrossRef
  15. Schlachter, U., et al.: https://github.com/renke/apt
  16. Teruel, E., Colom, J.M., Silva, M.: Choice-Free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals. IEEE Transactions on Systems, Man and Cybernetics, Part A, 73鈥?3 (1997)
  17. Ville, J.: Sur la th茅orie g茅n茅rale des jeux o霉 intervient l鈥檋abilet茅 des joueurs. In: Borel, E. (ed.) Trait茅 du calcul des probabilit茅s et de ses applications, vol.聽4, pp. 105鈥?13. Gauthiers-Villars (1938)
  18. Yakovlev, A.: Designing control logic for counterflow pipeline processor using Petri nets. Formal Methods in Systems Design聽12(1), 39鈥?1 (1998) CrossRef
  19. Yakovlev, A.: Theory and practice of using models of concurrency in hardware design. DSc Thesis, University of Newcastle upon Tyne (August 2005)
  
• 作者单位：Eike Best (17)
  Raymond Devillers (18)
  
  17. Department of Computing Science, Carl von Ossietzky Universit盲t Oldenburg, Germany
  18. D茅partement d鈥橧nformatique, Universit茅 Libre de Bruxelles, Belgium
  
• ISSN：1611-3349

文摘

This paper presents efficient, specialised synthesis and reengineering algorithms for the case that a transition system is finite, persistent and reversible. It also shows by means of a complex example that structural properties of the synthesised Petri nets may not necessarily be entailed.