S. Akshay

According to our database1, S. Akshay authored at least 47 papers between 2007 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Knowledge Compilation for Boolean Functional Synthesis.
CoRR, 2019

Timed Systems through the Lens of Logic.
CoRR, 2019

Continuous Reachability for Unordered Data Petri nets is in PTime.
CoRR, 2019

Timed Systems through the Lens of Logic.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Continuous Reachability for Unordered Data Petri Nets is in PTime.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

Functional Significance Checking in Noisy Gene Regulatory Networks.
Proceedings of the Principles and Practice of Constraint Programming, 2019

2018
Analyzing Timed Systems Using Tree Automata.
Logical Methods in Computer Science, 2018

Distribution-based objectives for Markov Decision Processes.
CoRR, 2018

What's hard about Boolean Functional Synthesis.
CoRR, 2018

Distribution-based objectives for Markov Decision Processes.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

What's Hard About Boolean Functional Synthesis?
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Towards an Efficient Tree Automata based technique for Timed Systems.
CoRR, 2017

Towards Parallel Boolean Functional Synthesis.
CoRR, 2017

On Petri Nets with Hierarchical Special Arcs.
CoRR, 2017

Towards Parallel Boolean Functional Synthesis.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Complexity of Restricted Variants of Skolem and Related Problems.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Towards an Efficient Tree Automata Based Technique for Timed Systems.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

On Petri Nets with Hierarchical Special Arcs.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Robustness of Time Petri Nets under Guard Enlargement.
Fundam. Inform., 2016

Analyzing Timed Systems Using Tree Automata.
CoRR, 2016

Stochastic Timed Games Revisited.
CoRR, 2016

Combining Free Choice and Time in Petri Nets.
Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, 2016

On Regularity of Unary Probabilistic Automata.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Stochastic Timed Games Revisited.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Analyzing Timed Systems Using Tree Automata.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Decidable Classes of Unbounded Petri Nets with Time and Urgency.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

2015
Checking conformance for time-constrained scenario-based specifications.
Theor. Comput. Sci., 2015

Approximate Verification of the Symbolic Dynamics of Markov Chains.
J. ACM, 2015

Reachability problems for Markov chains.
Inf. Process. Lett., 2015

Skolem Functions for Factored Formulas.
CoRR, 2015

Skolem Functions for Factored Formulas.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

2014
Distributed Timed Automata with Independently Evolving Clocks.
Fundam. Inform., 2014

Sessions with an Unbounded Number of Agents.
Proceedings of the 14th International Conference on Application of Concurrency to System Design, 2014

2013
Event clock message passing automata: a logical characterization and an emptiness checking algorithm.
Formal Methods in System Design, 2013

The Steady-State Control Problem for Markov Decision Processes.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Implementing Realistic Asynchronous Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application.
IEEE/ACM Trans. Comput. Biology Bioinform., 2012

Regular set of representatives for time-constrained MSC graphs.
Inf. Process. Lett., 2012

Robustness of Time Petri Nets under Guard Enlargement.
Proceedings of the Reachability Problems - 6th International Workshop, 2012

Approximate Verification of the Symbolic Dynamics of Markov Chains.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Symbolically Bounding the Drift in Time-Constrained MSC Graphs.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2012, 2012

Robustness of Time Petri Nets under Architectural Constraints.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2012

2011
A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways.
Proceedings of the Computational Methods in Systems Biology, 9th International Conference, 2011

2010
Model checking time-constrained scenario-based specifications.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2008
Distributed Timed Automata with Independently Evolving Clocks.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007
Automata and Logics for Timed Message Sequence Charts.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Checking Coverage for Infinite Collections of Timed Scenarios.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007


  Loading...