Shibashis Guha

Orcid: 0000-0002-9814-6651

According to our database1, Shibashis Guha authored at least 41 papers between 2006 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.
Log. Methods Comput. Sci., 2024

Expectation in Stochastic Window Mean-Payoff Games.
CoRR, 2024

Stochastic Window Mean-Payoff Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023
Timed network games.
Inf. Comput., January, 2023

Set Augmented Finite Automata over Infinite Alphabets.
Proceedings of the Developments in Language Theory - 27th International Conference, 2023

History-Deterministic Parikh Automata.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

A Game of Pawns.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

Reinforcement Learning for Omega-Regular Specifications on Continuous-Time MDP.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
History-deterministic Parikh Automata.
CoRR, 2022

PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP.
CoRR, 2022

Strategy Synthesis for Global Window PCTL.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Parikh Automata over Infinite Words.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
Alternating Tree Automata with Qualitative Semantics.
ACM Trans. Comput. Log., 2021

Safe Learning for Near-Optimal Scheduling.
Proceedings of the Quantitative Evaluation of Systems - 18th International Conference, 2021

Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Stackelberg Mean-payoff Games with a Rationally Bounded Adversarial Follower.
CoRR, 2020

Safe Learning for Near Optimal Scheduling.
CoRR, 2020

Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019
Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable.
CoRR, 2019

Multi-player flow games.
Auton. Agents Multi Agent Syst., 2019

Two-Way Parikh Automata.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Expected Window Mean-Payoff.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Expected Reachability-Price Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2019

2018
An Abstraction-Refinement Methodologyfor Reasoning about Network Games<sup>†</sup>.
Games, 2018

Timed Network Games with Clocks.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Safe and Optimal Scheduling for Hard and Soft Tasks.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Timed Vacuity.
Proceedings of the Formal Methods - 22nd International Symposium, 2018

2017
Adding Dense-Timed Stack to Integer Reset Timed Automata.
Proceedings of the Reachability Problems - 11th International Workshop, 2017

An Abstraction-Refinement Methodology for Reasoning about Network Games.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
From Traces to Proofs: Proving Concurrent Programs Safe.
Proceedings of the 10th International Symposium on Theoretical Aspects of Software Engineering, 2016

Mean-Payoff Games on Timed Automata.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Synthesizing time-triggered schedules for switched networks with faulty links.
Proceedings of the 2016 International Conference on Embedded Software, 2016

2015
From Traces To Proofs: Proving Concurrent Program Safe.
CoRR, 2015

Revisiting Robustness in Priced Timed Games.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
Reducing Clocks in Timed Automata while Preserving Bisimulation.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013
Inferring Fences in a Concurrent Program Using SC proof of Correctness
CoRR, 2013

A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization.
Proceedings of the Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics, 2013

2012
Game Characterizations of Timed Relations for Timed Automata Processes
CoRR, 2012

On Decidability of Prebisimulation for Timed Automata.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2006
LogicFence: A Framework for Enforcing Global Integrity Constraints at Runtime.
Proceedings of the Tenth International Database Engineering and Applications Symposium (IDEAS 2006), 2006


  Loading...