According to our database1, Kamal Lodaya authored at least 37 papers between 1985 and 2018.
Legend:Book In proceedings Article PhD thesis Other
An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018
Deterministic Temporal Logics and Interval Constraints.
Proceedings of the Ninth Workshop on Methods for Modalities, 2017
Two-Variable First Order Logic with Counting Quantifiers: Complexity Results.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017
Two-variable Logic with a Between Predicate.
Two-variable Logic with a Between Relation.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
Kleene Theorems for Synchronous Products with Matching.
Trans. Petri Nets and Other Models of Concurrency, 2015
Kleene Theorems for Labelled Free Choice Nets.
Proceedings of the International Workshop on Petri Nets and Software Engineering, 2014
A Language-Theoretic View of Verification.
Modern Applications of Automata Theory, 2012
Fine-grained Concurrency with Separation Logic.
J. Philosophical Logic, 2011
Parameterized complexity results for 1-safe Petri nets
Kleene Theorems for Product Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2011
Parameterized Complexity Results for 1-safe Petri Nets.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011
Frontmatter, Table of Contents, Preface, Conference Organization, Author Index.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010
Around Dot Depth Two.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010
LTL Can Be More Succinct.
Proceedings of the Automated Technology for Verification and Analysis, 2010
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009
Analyzing Reachability for Some Petri Nets With Fast Growing Markings.
Electr. Notes Theor. Comput. Sci., 2008
Marking the chops: an unambiguous temporal logic.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008
Petri Nets, Event Structures and Algebra.
Proceedings of the Formal Models, 2007
A regular viewpoint on processes and algebra.
Acta Cybern., 2006
Product Automata and Process Algebra.
Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), 2006
A Dose of Timed Logic, in Guarded Measure.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006
Hierarchical Structure of 1-Safe Petri Nets.
Proceedings of the Advances in Computing Science, 2003
Rationality in Algebras with a Series Operation.
Inf. Comput., 2001
Series-parallel languages and the bounded-width property.
Theor. Comput. Sci., 2000
An Automaton Model of User-Controlled Navigation on the Web.
Proceedings of the Implementation and Application of Automata, 2000
Sharpening the Undecidability of Interval Temporal Logic.
Proceedings of the Advances in Computing Science, 2000
Series-Parallel Posets: Algebra, Automata and Languages.
Proceedings of the STACS 98, 1998
A Kleene Iteration for Parallelism.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998
A Logical Study of Distributed Transition Systems
Inf. Comput., May, 1995
Decidability of a Partial Order Based Temporal Logic.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
Temporal Logics for Communicating Sequential Agents: I.
Int. J. Found. Comput. Sci., 1992
Tense Logics for Local Reasoning in Distributed Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991
Proof Theory for Exception Handling in a Tasking Environment.
Acta Inf., 1990
A logic for distributed transition systems.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988
A Modal Logic for a Subclass of Event Structures.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
Proving Fairness of Schedulers.
Proceedings of the Logics of Programs, 1985