Synchronizing sequences on a class of unbounded systems using synchronized Petri nets

Discrete Event Dynamic Systems: Theory and Applications

Volumn 26, Issue 1, 2016, Pages 85-108

  Pocci, Marco ^a,b   Demongodin, Isabel ^a   Giambiasi, Norbert ^a   Giua, Alessandro ^a,b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIVERSITY OF CAGLIARI   (Italy)

Author keywords

Coverability graph; Synchronized Petri nets; Synchronizing sequences; Testing theory; Unbounded nets

Indexed keywords

PETRI NETS; PROBLEM SOLVING;

COVERABILITY GRAPHS; SYNCHRONIZED PETRI NETS; SYNCHRONIZING SEQUENCE; TESTING THEORIES; UNBOUNDED NETS;

SYNCHRONIZATION;

EID: 84959245034     PISSN: 09246703     EISSN: 15737594     Source Type: Journal    
DOI: 10.1007/s10626-016-0225-6     Document Type: Article

References (24)

1. Ananichev D, Volkov MV (2003) Synchronizing monotonic automata. Lecture Notes in Computer Science 111–121
2. Benenson Y, Adar R, Paz-Elizur T, Livneh Z, Shapiro E (2003) Dna molecule provides a computing machine with both data and fuel. Proc National Acad Sci USA 100(5):2191–2196. doi:10.1073/pnas.0535624100
3. Benenson Y, Paz-Elizur T, Adar R, Keinan E, Livneh Z, Shapiro E (2001) Programmable and autonomous computing machine made of biomolecules. Nature 414:430–434. doi:10.1038/35106533
4. Cheng KT, Agrawal V (1992) Initializability consideration in sequential machine synthesis. IEEE Trans Comput 41:374–379. doi:10.1109/12.127453
5. Cho H, Jeong SW, Somenzi F, Pixley C (1993) Multiple observation time single reference test generation using synchronizing sequences. In: Proceedings of the 4th european conference on Design automation, 1993, with the european event in ASIC design, pp 494–498. doi:10.1109/EDAC.1993.386426
6. David R, Alla H (2004) Discrete, continuous and hybrid Petri nets Springer-Verlag
7. Devillers R, Van Begin L (2006) Boundedness undecidability for synchronized nets. Inf Process Lett 99(5):208–214. doi:10.1016/j.ipl.2006.04.009
8. Ding Z, Jiang C, Zhou M (2008) Deadlock checking for one-place unbounded Petri nets based on modified reachability trees. IEEE Trans Syst Man Cybern B Cybern 38(3):881–883. doi:10.1109/TSMCB.2008.917177
9. Finkel A (1993) The minimal coverability graph for Petri nets. In: Papers from the 12th international conference on applications and theory of Petri nets: Advances in Petri nets 1993. Springer, London, pp 210–243
10. Geeraerts G, Raskin JF, Van Begin L (2010) On the efficient computation of the minimal coverability set for Petri nets. Int J Found Comput Sci 21(02):135–165. doi:10.1142/S0129054110007180
11. Jürgensen H (2008) Synchronization. Inf Comput 206:1033–1044. 10.1016/j.ic.2008.03.005. http://dl.acm.org/citation.cfm?id=1410483.1410835
12. Kari J (2002) Synchronization and stability of finite automata. J Universal Comput Sci 8(2):270–277
13. Karp RM, Miller RE (1969) Parallel program schemata. J Comput Syst Sci 3(2):147–195. doi:10.1016/S0022-0000(69)80011-5
14. Lee D, Yannakakis M (1996) Principles and methods of testing finite state machine – a survey. Proc IEEE 84(8):1090–1123
15. Mayr EW, Meyer AR (1981) The complexity of the finite containment problem for Petri nets. J ACM 28(3):561–576. doi:10.1145/322261.322271
16. Moore EF (1956) Gedanken-experiments on sequential machines. Automata Studies. Ann Math Stud 34:129–153
17. Murata T (1989) Petri nets: Properties, analysis and applications. Proc IEEE 77(4):541–580. doi:10.1109/5.24143
18. Natarajan BK (1986) An algorithmic approach to the automated design of parts orienters. In: SFCS ’86: Proc. of the 27th annual symposium on foundations of computer science. doi:10.1109/SFCS.1986.5. IEEE Computer Society, Washington, pp 132–142
19. Pocci M (2013) Test and diagnosis of discrete event systems using Petri nets. Ph.D. thesis, Aix-Marseille University & University of Cagliari. http://www.lsis.org/poccim/phd_thesis_marco_pocci.pdf
20. Pocci M, Demongodin I, Giambiasi N, Giua A (2013) A new algorithm to compute synchronizing sequences for synchronized Petri nets. In: IEEE Tencon conference for Region 10 (TENCON). Xi’an, Shaanxi, China. doi:10.1109/TENCON.2013.6718970
21. Pocci M, Demongodin I, Giambiasi N, Giua A (2014a) Testing experiments on synchronized Petri nets. IEEE Trans Autom Sci Eng 11(1):125–138. doi:10.1109/TASE.2013.2290774
22. Pocci M, Demongodin I, Giambiasi N, Giua A (2014b) Testing experiments on unbounded systems: synchronizing sequences using Petri nets. In: WODES 14: 12th int. Workshop on discrete event systems. Cachan, France. doi:10.3182/20140514-3-FR-4046.00104, pp 155–161
23. Reynier PA, Servais F (2011) Minimal coverability set for Petri nets: Karp and miller algorithm with pruning. In: Proceedings of the 32nd international conference on applications and theory of Petri nets, Petri NETS’11. Springer, Berlin, pp 69–88
24. Wang S, Zhou M, Li Z, Wang C (2013) A new modified reachability tree approach and its applications to unbounded Petri nets. IEEE Trans Syst Man Cybern B Cybern 43(4):932–940. doi:10.1109/TSMCA.2012.2226878