Shankara Narayanan Krishna

According to our database1, Shankara Narayanan Krishna authored at least 79 papers between 1999 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Verification of programs under the release-acquire semantics.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018
Regular Transducer Expressions for Regular Transformations.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Regular and First-Order List Functions.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Verification of Timed Asynchronous Programs.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Perfect Timed Communication Is Hard.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2018

Logics Meet 1-Clock Alternating Timed Automata.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Further results on generalised communicating P systems.
Theor. Comput. Sci., 2017

Making Metric Temporal Logic Rational.
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

The Reach-Avoid Problem for Constant-Rate Multi-mode Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2017

2016
Traceability Analyses between Features and Assets in Software Product Lines.
Entropy, 2016

On Nonlinear Prices in Timed Automata.
Proceedings of the The First Workshop on Verification and Validation of Cyber-Physical Systems, 2016

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

A Logical Characterization for Dense-Time Visibly Pushdown Automata.
Proceedings of the Language and Automata Theory and Applications, 2016

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

FO-Definable Transformations of Infinite Strings.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Metric Temporal Logic with Counting.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

A Perfect Class of Context-Sensitive Timed Languages.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

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

2015
Reachability Games on Recursive Hybrid Automata.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

On Pure Nash Equilibria in Stochastic Games.
Proceedings of the Theory and Applications of Models of Computation, 2015

Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable.
Proceedings of the Language and Automata Theory and Applications, 2015

What's decidable about recursive hybrid automata?
Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 2015

Bounded-rate multi-mode systems based motion planning.
Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 2015

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

Compositional modeling and analysis of automotive feature product lines.
Proceedings of the 52nd Annual Design Automation Conference, 2015

2014
Improved Undecidability Results for Reachability Games on Recursive Timed Automata.
Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Partially Punctual Metric Temporal Logic is Decidable.
Proceedings of the 21st International Symposium on Temporal Representation and Reasoning, 2014

On Unary Fragments of MTL and TPTL over Timed Words.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2014, 2014

A Cost Effective Approach for Analyzing Software Product Lines.
Proceedings of the Distributed Computing and Internet Technology, 2014

First-order Definable String Transformations.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Weak Singular Hybrid Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2014

Adding Negative Prices to Priced Timed Games.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

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

Compositional Verification of Software Product Lines.
Proceedings of the Integrated Formal Methods, 10th International Conference, 2013

Solving the 4QBF Problem in Polynomial Time by Using the Biological-Inspired Mobility.
Proceedings of the Distributed Computing and Internet Technology, 2013

Some Classes of Generalised Communicating P Systems and Simple Kernel P Systems.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Tracing SPLs precisely and efficiently.
Proceedings of the 16th International Software Product Line Conference, 2012

Nash Equilibrium in Weighted Concurrent Timed Games with Reachability Objectives.
Proceedings of the Distributed Computing and Internet Technology, 2012

On the Computability Power of Membrane Systems with Controlled Mobility.
Proceedings of the How the World Computes, 2012

2011
Model Checking Weighted Integer Reset Timed Automata.
Theory Comput. Syst., 2011

Enhanced Mobile Membranes: Computability Results.
Theory Comput. Syst., 2011

On Restricted Bio-Turing Machines.
Fundam. Inform., 2011

Matrix Insertion-Deletion Systems for Bio-Molecular Structures.
Proceedings of the Distributed Computing and Internet Technology, 2011

An Overview of Membrane Computing.
Proceedings of the Distributed Computing and Internet Technology, 2011

On Construction of Safety Signal Automata for $MITL[\: \mathcal{U}, \: \mathcal{S}]$ Using Temporal Projections.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

A S2P ÈP2P\Sigma_2^P \cup \Pi_2^P Lower Bound Using Mobile Membranes.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

Computability Power of Mobility in Enhanced Mobile Membranes.
Proceedings of the Models of Computation in Context, 2011

2009
Membrane computing with transport and embedded proteins.
Theor. Comput. Sci., 2009

Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009

2008
The Expressiveness of Concentration Controlled P Systems.
Proceedings of the Unconventional Computing, 7th International Conference, 2008

Timed Automata with Integer Resets: Language Inclusion and Expressiveness.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

Updatable Timed Automata with Additive and Diagonal Constraints.
Proceedings of the Logic and Theory of Algorithms, 2008

On the Computational Power of Enhanced Mobile Membranes.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Universality results for P systems based on brane calculi operations.
Theor. Comput. Sci., 2007

On Sampling Abstraction of Continuous Time Logic with Durations.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

On the Computational Power of Flip-Flop Proteins on Membranes.
Proceedings of the Computation and Logic in the Real World, 2007

Towards Reducing Parallelism in P Systems.
Proceedings of the Formal Models, 2007

2006
On the Power of Bio-Turing Machines.
Proceedings of the Unconventional Computation, 5th International Conference, 2006

On Pure Catalytic P Systems.
Proceedings of the Unconventional Computation, 5th International Conference, 2006

Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
P Systems with Mobile Membranes.
Natural Computing, 2005

Further Results on Contextual and Rewriting P Systems.
Fundam. Inform., 2005

Modal Strength Reduction in Quantified Discrete Duration Calculus.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Communicating Distributed H Systems: Optimal Results with Efficient Ways of Communication.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

The Power of Mobility: Four Membranes Suffice.
Proceedings of the New Computational Paradigms, 2005

2004
Results on Catalytic and Evolution-Communication P Systems.
New Generation Comput., 2004

P Systems with Symport/Antiport: The Traces of RBCs.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

2003
Breaking DES using P systems.
Theor. Comput. Sci., 2003

On Some Classes of Contextual Grammars.
Int. J. Comput. Math., 2003

2002
On the Power of P Systems with Contextual Rules.
Fundam. Inform., 2002

Tissue P Systems with Contextual and Rewriting Rules.
Proceedings of the Membrane Computing, International Workshop, 2002

On The Power of Tissue P Systems Working in the Minimal Mode.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

2001
P Systems with Replicated Rewriting.
Journal of Automata, Languages and Combinatorics, 2001

On power of p systems using sequential and parallel rewriting.
Int. J. Comput. Math., 2001

A Note on Parallel Rewriting in P Systems.
Bulletin of the EATCS, 2001

P Systems with Picture Objects.
Acta Cybern., 2001

Insertion-Deletion P Systems.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

1999
Contextual Array Splicing Systems.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999


  Loading...