Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amol Wakankar

dblp:200/8370 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2Theory of computation · 2 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking
reactive synthesis
0.612022
Specification and optimal reactive synthesis of run-time enforcement shields · Inf. Comput. 2022
Automated reasoning and model checking › synthesis
shield synthesis
0.612022
Specification and optimal reactive synthesis of run-time enforcement shields · Inf. Comput. 2022

Methods — techniques the papers use, named apart from their topics

temporal logic · 0.6game solving · 0.6
YearPublicationVenuePosition
2022 Specification and optimal reactive synthesis of run-time enforcement shields
Paritosh K. Pandya, Amol Wakankar
Inf. Comput.2
2019 Logical specification and uniform synthesis of robust controllers
abstract
This paper investigates the synthesis of robust controllers from a logical specification of regular properties given in an interval temporal logic QDDC. Our specification encompasses both hard robustness and soft robustness. Here, hard robustness guarantees the invariance of commitment under relaxed (weakened) assumptions. A systematic framework for logically specifying the assumption weakening by means of a QDDC formula Rb(A), called Robustness criterion, is presented. This can be used with any user specified assumption DA to obtain a relaxed (weakened) assumption Rb(DA). A variety of robustness criteria encompassing some existing notions such as k, b resilience as well as some new notions like tolerating non-burst errors and recovery from transient errors are formulated logically. The soft robustness pertains to the ability of the controller to maintain the commitment for as many inputs as possible, irrespective of any assumption. We present a uniform method for the synthesis of a robust controller which guarantees the invariance of specified hard robustness and it optimizes the expected value of occurrence of commitment across input sequences. Through the case study of a synchronous bus arbiter, we experimentally show the impact of variety of hard robustness criteria as well as the soft robustness on the ability of the synthesized controllers to meet the commitment "as much as possible".
Paritosh K. Pandya, Amol Wakankar
MEMOCODE2
2017 Formalizing Timing Diagram Requirements in Discrete Duration Calculus
M. Raj Mohan, Paritosh K. Pandya, Amol Wakankar
SEFM3