Somsak Vanit-Anunchai

According to our database, Somsak Vanit-Anunchai authored at least 18 papers between 2005 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Solving Combinatorial Problems using Coloured Petri Nets.

Somsak Vanit-Anunchai

Proceedings of the Joint Proceedings of the Workshops at the 46th International Conference on Application and Theory of Petri Nets and Concurrency: Petri Nets and Software Engineering (PNSE'25), Algorithms & Theories for the Analysis of Event Data (ATAED'25), and Petri Net Games, Examples and Quizzes for Education, Contest and Fun (PeNGE'25) co-located with PETRI NETS 2025, June 23, 2025

2024

Solving Puzzles using Coloured Petri Nets.

Somsak Vanit-Anunchai

Proceedings of the Workshop Petri Net Games, 2024

2023

Teaching Low-Code Formal Methods with Coloured Petri Nets.

Somsak Vanit-Anunchai

Proceedings of the Formal Methods Teaching: 5th International Workshop, 2023

2018

Modelling and simulating a Thai railway signalling system using Coloured Petri Nets.

Somsak Vanit-Anunchai

Int. J. Softw. Tools Technol. Transf., 2018

2017

Validating DCCP Simultaneous-Open and Feature Negotiation Procedures.

Somsak Vanit-Anunchai

IEICE Trans. Inf. Syst., 2017

2016

Application of Coloured Petri Nets in Modelling and Simulating a Railway Signalling System.

Somsak Vanit-Anunchai

Proceedings of the Critical Systems: Formal Methods and Automated Verification, 2016

2015

Validating DCCP Simultaneous Feature Negotiation Procedure.

Somsak Vanit-Anunchai

Proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE'15), 2015

2014

Experience using Coloured Petri Nets to Model Railway Interlocking Tables.

Somsak Vanit-Anunchai

Proceedings of the Proceedings 2nd French Singaporean Workshop on Formal Methods and Applications, 2014

2013

Analysis of Two-Layer Protocols: DCCP Simultaneous-Open and Hole Punching Procedures.

Somsak Vanit-Anunchai

Proceedings of the 1st French Singaporean Workshop on Formal Methods and Applications, 2013

Validating SCTP Simultaneous Open Procedure.

Somsak Vanit-Anunchai

Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013

2010

Modelling Railway Interlocking Tables Using Coloured Petri Nets.

Somsak Vanit-Anunchai

Proceedings of the Coordination Models and Languages, 12th International Conference, 2010

2009

Parameterised Coloured Petri Net Channel Models.

Jonathan Billington, Somsak Vanit-Anunchai, Guy Edward Gallasch

Trans. Petri Nets Other Model. Concurr., 2009

2008

Analysis of the Datagram Congestion Control Protocol's connection management procedures using the sweep-line method.

Somsak Vanit-Anunchai, Jonathan Billington, Guy Edward Gallasch

Int. J. Softw. Tools Technol. Transf., 2008

Coloured Petri Net Modelling of an Evolving Internet Standard: the Datagram Congestion Control Protocol.

Jonathan Billington, Somsak Vanit-Anunchai

Fundam. Informaticae, 2008

2007

Checking safety properties on-the-fly with the sweep-line method.

Guy Edward Gallasch, Jonathan Billington, Somsak Vanit-Anunchai, Lars Michael Kristensen

Int. J. Softw. Tools Technol. Transf., 2007

Modelling the Datagram Congestion Control Protocol's Connection Management and Synchronization Procedures.

Somsak Vanit-Anunchai, Jonathan Billington

Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006

Effect of Sequence Number Wrap on DCCP Connection Establishment.

Somsak Vanit-Anunchai, Jonathan Billington

Proceedings of the 14th International Symposium on Modeling, 2006

2005

Discovering Chatter and Incompleteness in the Datagram Congestion Control Protocol.

Somsak Vanit-Anunchai, Jonathan Billington, Tul Kongprakaiwoot

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005