generated by bibbase.org
  2023 (1)
Teaching Low-Code Formal Methods with Coloured Petri Nets. Vanit-Anunchai, S. In Formal Methods Teaching Workshop, pages 96–104, 2023. Springer, Cham
link   bibtex  
  2021 (1)
A Train Rescheduling System Using Timed Coloured Petri Nets. Vanit-Anunchai, S. In Urban Rail Transit: Proceedings of the 6th Thailand Rail Academic Symposium, pages 245–256, 2021. Springer Singapore
link   bibtex  
  2018 (2)
Modelling and simulating a Thai railway signalling system using Coloured Petri Nets. Vanit-Anunchai, S. International Journal on Software Tools for Technology Transfer, 20: 243–262. 2018.
link   bibtex  
Railway network modeling using building block of timed coloured petri nets. Songwiroj, N.; Vatanawood, W.; and Vanit-Anunchai, S. In 2018 IEEE 4th International Conference on Computer and Communications (ICCC), pages 528–533, 2018. IEEE
link   bibtex  
  2017 (1)
Validating DCCP Simultaneous-Open and Feature Negotiation Procedures. Vanit-Anunchai, S. IEICE TRANSACTIONS on Information and Systems, 100(6): 1190–1199. 2017.
link   bibtex  
  2016 (2)
Validating DCCP simultaneous feature negotiation procedure. Vanit-Anunchai, S. Transactions on Petri Nets and Other Models of Concurrency XI,71–91. 2016.
link   bibtex  
Application of coloured petri nets in modelling and simulating a railway signalling system. Vanit-Anunchai, S. In Critical Systems: Formal Methods and Automated Verification: Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings 21, pages 214–230, 2016. Springer International Publishing
link   bibtex  
  2014 (1)
Experience using coloured petri nets to model railway interlocking tables. Vanit-Anunchai, S. arXiv preprint arXiv:1407.3891. 2014.
link   bibtex  
  2013 (2)
Validating SCTP simultaneous open procedure. Vanit-Anunchai, S. In Fundamentals of Software Engineering: 5th International Conference, FSEN 2013, Tehran, Iran, April 24-26, 2013, Revised Selected Papers 5, pages 233–249, 2013. Springer Berlin Heidelberg
link   bibtex  
Analysis of two-layer protocols: DCCP simultaneous-open and hole punching procedures. Vanit-Anunchai, S. In 1st French Singaporean Workshop on Formal Methods and Applications (FSFMA 2013), 2013. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
link   bibtex  
  2010 (1)
Modelling railway interlocking tables using coloured petri nets. Vanit-Anunchai, S. In Coordination Models and Languages: 12th International Conference, COORDINATION 2010, Amsterdam, The Netherlands, June 7-9, 2010. Proceedings 12, pages 137–151, 2010. Springer Berlin Heidelberg
link   bibtex  
  2009 (2)
Verification of railway interlocking tables using coloured Petri nets. Vanit-Anunchai, S. In the tenth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, DAIMI PB, volume 590, pages 139–158, 2009.
link   bibtex  
Parameterised coloured Petri net channel models. Billington, J.; Vanit-Anunchai, S.; and Gallasch, G. E Transactions on Petri Nets and Other Models of Concurrency III,71–97. 2009.
link   bibtex  
  2008 (3)
Coloured Petri net modelling of an evolving Internet standard: The datagram congestion control protocol. Billington, J.; and Vanit-Anunchai, S. Fundamenta Informaticae, 88(3): 357–385. 2008.
link   bibtex  
Towards formal modelling and analysis of SCTP connection management. Vanit-Anunchai, S. In Proceedings of the Ninth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, 2008. Citeseer
link   bibtex  
Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method. Vanit-Anunchai, S.; Billington, J.; and Gallasch, G. E. International Journal on Software Tools for Technology Transfer, 10(1): 29–56. 2008.
link   bibtex  
  2007 (3)
An Investigation of the Datagram Congestion Control Protocol's Connection Management and Synchronisation Procedures. Vanit-Anunchai, S. Ph.D. Thesis, University of South Australia, 2007.
link   bibtex  
Modelling the Datagram Congestion Control Protocol’s connection management and synchronization procedures. Vanit-Anunchai, S.; and Billington, J. In Petri Nets and Other Models of Concurrency–ICATPN 2007: 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007. Proceedings 28, pages 423–444, 2007. Springer Berlin Heidelberg
link   bibtex  
Checking safety properties on-the-fly with the sweep-line method. Gallasch, G. E.; Billington, J.; Vanit-Anunchai, S.; and Kristensen, L. M. International Journal on Software Tools for Technology Transfer, 9(3-4): 371–391. 2007.
link   bibtex  
  2006 (2)
Sweep-line analysis of DCCP connection management. Vanit-Anunchai, S.; Billington, J.; and Gallasch, G. E. Ph.D. Thesis, University of Aarhus, 2006.
link   bibtex  
Effect of sequence number wrap on DCCP connection establishment. Vanit-Anunchai, S.; and Billington, J. In 14th IEEE International Symposium on Modeling, Analysis, and Simulation, pages 345–354, 2006. IEEE
link   bibtex  
  2005 (4)
Discovering chatter and incompleteness in the Datagram Congestion Control Protocol. Vanit-Anunchai, S.; Billington, J.; and Kongprakaiwoot, T. In Formal Techniques for Networked and Distributed Systems-FORTE 2005: 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005. Proceedings 25, pages 143–158, 2005. Springer Berlin Heidelberg
link   bibtex  
Checking language inclusion on-the-fly with the sweep-line method. Gallasch, G. E.; Vanit-Anunchai, S.; Billington, J.; and Kristensen, L. M. In Sixth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, pages 1, 2005.
link   bibtex  
Chattering behaviour in datagram congestion control protocol. Vanit-Anunchai, S.; and Billington, J Electronics Letters, 41(21): 1. 2005.
link   bibtex  
Modelling dynamic influence diagrams using coloured petri nets. Vanit-Anunchai, S. Ph.D. Thesis, Society for Modeling and Simulation International, 2005.
link   bibtex  
  2004 (2)
Modelling probabilistic inference using coloured petri nets and factor graphs. Vanit-Anunchai, S.; and Billington, J. Ph.D. Thesis, University of Aarhus, 2004.
link   bibtex  
Initial result of a formal analysis of DCCP connection management. Vanit-Anunchai, S.; and Billington, J Proceedings of INC,63–70. 2004.
link   bibtex  
  undefined (2)
A Combined Protocol Channel Model and its Application to the Datagram Congestion Control Protocol. Vanit-Anunchai, S. Ph.D. Thesis, .
link   bibtex  
Checking Safety Properties On-the-fly with the Sweep-Line Method. Vanit-Anunchai, S. Ph.D. Thesis, Springer-Verlag, .
link   bibtex