default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Larionov
Person information
- affiliation: Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]A. V. Davydov
, Alexander Larionov, Nadezhda V. Nagul:
On the Application of the Calculus of Positively Constructed Formulas for the Study of Controlled Discrete-Event Systems. Autom. Control. Comput. Sci. 58(7): 1042-1062 (2024)- [j2]Artem Davydov, Aleksandr Larionov, Nadezhda V. Nagul:
Analysis and Control of Partially Observed Discrete-Event Systems via Positively Constructed Formulas. Comput. 12(5): 95 (2024) - 2022
- [c12]Artem Davydov, Aleksandr Larionov, Nadezhda V. Nagul:
On Checking Observability of Formal Languages in DES Control Problems. CoDIT 2022: 1567-1572 - 2021
- [c11]Artem Davydov, Aleksandr Larionov, Nadezhda V. Nagul:
Modular discrete event systems control based on logic inference. ICCS-DE 2021: 32-46 - [c10]Artem Davydov, Aleksandr Larionov, Nadezhda V. Nagul:
Positively Constructed Formulas-Based Approach to Mobile Robot Control Using DES. MIPRO 2021: 1064-1069 - 2020
- [c9]Artem Davydov, Aleksandr Larionov:
Action Planning for Robots using the First Order Logic Calculus of Positively Constructed Formulas. CoDIT 2020: 727-732 - [c8]Artem Davydov, Aleksandr Larionov, Nadezhda V. Nagul:
Logic inference based construction of a supervisor for a discrete event system. ICCS-DE 2020: 53-67 - [c7]Artem Davydov, Aleksandr Larionov, Nadezhda V. Nagul:
The construction of controllable sublanguage of specification for DES via PCFs based inference. ICCS-DE 2020: 68-78 - [c6]Artem Davydov, Aleksandr Larionov, Nadezhda V. Nagul:
On Checking Controllability of Specification Languages for DES. MIPRO 2020: 1151-1156
2010 – 2019
- 2019
- [c5]Artem Davydov, Aleksandr Larionov, Nadezhda V. Nagul:
PCF-based formalization of the parallel composition of automata. ICCS-DE 2019: 29-41 - 2018
- [c4]Artem Davydov, Aleksandr Larionov, Nadezhda V. Nagul:
The formal logic approach for checking the observability of a specification language on DES functioning. MIPRO 2018: 938-943 - 2017
- [c3]Artem Davydov, Aleksandr Larionov, Nadezhda V. Nagul:
The formal description of discrete-event systems using positively constructed formulas. MIPRO 2017: 1161-1165 - 2016
- [c2]Evgeny A. Cherkashin, Artem Davydov, Alexander Larionov:
Positive constructed formulas preprocessing for automatic deduction. MIPRO 2016: 1305-1308 - 2011
- [j1]A. V. Davydov, A. A. Larionov, Evgeny A. Cherkashin:
On the calculus of positively constructed formulas for automated theorem proving. Autom. Control. Comput. Sci. 45(7): 402-407 (2011) - [c1]A. A. Larionov, Evgeny A. Cherkashin, A. V. Davydov:
Theorem proving software, based on method of positively-constructed formulae. MIPRO 2011: 965-968
Coauthor Index
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 2025-03-08 01:49 CET 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:
