Valery A. Sokolov

Orcid: 0000-0003-1427-4937

According to our database1, Valery A. Sokolov authored at least 24 papers between 1997 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions.
Autom. Control. Comput. Sci., 2021

2019
A Question-Answering System for Applicant Support Using Modern Messaging Apps.
Autom. Control. Comput. Sci., 2019

2018
On Some Approaches to the Solution of the "Useful Proof-of-Work for Blockchains" Task.
Autom. Control. Comput. Sci., 2018

2017
Construction of CFC-Programs by LTL-Specification.
Autom. Control. Comput. Sci., 2017

2016
Instrumental supporting system for developing and analysis of software-defined networks of mobile objects.
Autom. Control. Comput. Sci., 2016

On the expressiveness of the approach to constructing PLC-programs by LTL-specification.
Autom. Control. Comput. Sci., 2016

Principles of organizing the interoperability of equipollent nodes in a wireless mesh-network with time division multiple access.
Autom. Control. Comput. Sci., 2016

2015
Construction and verification of PLC-programs by LTL-specification.
Autom. Control. Comput. Sci., 2015

2014
Construction and verification of PLC LD programs by the LTL specification.
Autom. Control. Comput. Sci., 2014

Modeling, specification and construction of PLC-programs.
Autom. Control. Comput. Sci., 2014

Modeling a consistent behavior of PLC-sensors.
Autom. Control. Comput. Sci., 2014

2013
The modeling of counter machines by two-head finite automata.
Autom. Control. Comput. Sci., 2013

On construction and verification of PLC programs.
Autom. Control. Comput. Sci., 2013

2010
Boundedness problems for Minsky counter machines.
Program. Comput. Softw., 2010

On a class of high-level finite-state automata.
Autom. Control. Comput. Sci., 2010

2009
Application of the trace assertion method to the specification, design, and verification of automaton programs.
Program. Comput. Softw., 2009

2008
Modeling, specification, and verification of automaton programs.
Program. Comput. Softw., 2008

2005
An Approach to the Implementation of the Dynamical Priorities Method.
Proceedings of the Parallel Computing Technologies, 2005

2004
Model Checking mu-Calculus in Well-Structured Transition Systems.
Proceedings of the 11th International Symposium on Temporal Representation and Reasoning (TIME 2004), 2004

2003
An Extensible Coloured Petri Net Model of a Transport Protocol for Packet Switched Networks.
Proceedings of the Parallel Computing Technologies, 2003

2002
Modeling and traffic analysis of the adaptive rate transport protocol.
Future Gener. Comput. Syst., 2002

2001
ARTCP: Efficient Algorithm for Transport Protocol for Packet Switched Networks.
Proceedings of the Parallel Computing Technologies, 2001

Dynamical Priorities without Time Measurement and Modification of the TCP.
Proceedings of the Perspectives of System Informatics, 2001

1997
On a Technology of Design and Analysis of Dataflow Programs.
Proceedings of the Parallel Computing Technologies, 1997


  Loading...