default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSomsak Vanit-Anunchai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Somsak Vanit-Anunchai:
Solving Puzzles using Coloured Petri Nets. PeNGE@Petri Nets 2024- 2023
- [c10]Somsak Vanit-Anunchai:
Teaching Low-Code Formal Methods with Coloured Petri Nets. FMTea 2023: 96-104
2010 – 2019
- 2018
- [j7]Somsak Vanit-Anunchai
:
Modelling and simulating a Thai railway signalling system using Coloured Petri Nets. Int. J. Softw. Tools Technol. Transf. 20(3): 243-262 (2018) - 2017
- [j6]Somsak Vanit-Anunchai:
Validating DCCP Simultaneous-Open and Feature Negotiation Procedures. IEICE Trans. Inf. Syst. 100-D(6): 1190-1199 (2017) - 2016
- [j5]Somsak Vanit-Anunchai:
Validating DCCP Simultaneous Feature Negotiation Procedure. Trans. Petri Nets Other Model. Concurr. 11: 71-91 (2016) - [c9]Somsak Vanit-Anunchai:
Application of Coloured Petri Nets in Modelling and Simulating a Railway Signalling System. FMICS-AVoCS 2016: 214-230 - 2015
- [c8]Somsak Vanit-Anunchai:
Validating DCCP Simultaneous Feature Negotiation Procedure. PNSE @ Petri Nets 2015: 115-132 - 2014
- [c7]Somsak Vanit-Anunchai:
Experience using Coloured Petri Nets to Model Railway Interlocking Tables. FSFMA 2014: 17-28 - 2013
- [c6]Somsak Vanit-Anunchai:
Validating SCTP Simultaneous Open Procedure. FSEN 2013: 233-249 - [c5]Somsak Vanit-Anunchai:
Analysis of Two-Layer Protocols: DCCP Simultaneous-Open and Hole Punching Procedures. FSFMA 2013: 3-17 - 2010
- [c4]Somsak Vanit-Anunchai:
Modelling Railway Interlocking Tables Using Coloured Petri Nets. COORDINATION 2010: 137-151
2000 – 2009
- 2009
- [j4]Jonathan Billington, Somsak Vanit-Anunchai, Guy Edward Gallasch:
Parameterised Coloured Petri Net Channel Models. Trans. Petri Nets Other Model. Concurr. 3: 71-97 (2009) - 2008
- [j3]Jonathan Billington, Somsak Vanit-Anunchai:
Coloured Petri Net Modelling of an Evolving Internet Standard: the Datagram Congestion Control Protocol. Fundam. Informaticae 88(3): 357-385 (2008) - [j2]Somsak Vanit-Anunchai, Jonathan Billington, Guy Edward Gallasch:
Analysis of the Datagram Congestion Control Protocol's connection management procedures using the sweep-line method. Int. J. Softw. Tools Technol. Transf. 10(1): 29-56 (2008) - 2007
- [j1]Guy Edward Gallasch, Jonathan Billington, Somsak Vanit-Anunchai, Lars Michael Kristensen:
Checking safety properties on-the-fly with the sweep-line method. Int. J. Softw. Tools Technol. Transf. 9(3-4): 371-391 (2007) - [c3]Somsak Vanit-Anunchai, Jonathan Billington:
Modelling the Datagram Congestion Control Protocol's Connection Management and Synchronization Procedures. ICATPN 2007: 423-444 - 2006
- [c2]Somsak Vanit-Anunchai, Jonathan Billington:
Effect of Sequence Number Wrap on DCCP Connection Establishment. MASCOTS 2006: 345-354 - 2005
- [c1]Somsak Vanit-Anunchai, Jonathan Billington, Tul Kongprakaiwoot:
Discovering Chatter and Incompleteness in the Datagram Congestion Control Protocol. FORTE 2005: 143-158
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-27 17:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
