| Publication | Date of Publication | Type |
|---|
| Reversible transducers over infinite words | 2026-02-10 | Paper |
| An efficient quantifier elimination procedure for Presburger arithmetic | 2026-01-14 | Paper |
| Counter machines with infrequent reversals | 2025-07-28 | Paper |
| Satisfiability checking of multi-variable TPTL with unilateral intervals is PSPACE-complete | 2025-06-26 | Paper |
| Timed systems through the lens of logic | 2024-12-19 | Paper |
| Efficient construction of reversible transducers from regular transducer expressions | 2024-12-06 | Paper |
From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers
Formal Aspects of Computing | 2024-09-25 | Paper |
| Resilience of Timed Systems | 2024-02-05 | Paper |
| Parameterized verification under TSO with data types | 2023-12-13 | Paper |
Optimal repair for omega-regular properties
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
| Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers | 2023-04-21 | Paper |
Revisiting underapproximate reachability for multipushdown systems
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
The Reach-Avoid Problem for Constant-Rate Multi-mode Systems
Automated Technology for Verification and Analysis | 2022-08-12 | Paper |
Synthesis of computable regular functions of infinite words
(available as arXiv preprint) | 2022-08-02 | Paper |
| Synthesis of computable regular functions of infinite words | 2022-08-02 | Paper |
On Synthesis of Resynchronizers for Transducers
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561313 (Why is no real title available?) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559472 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559499 (Why is no real title available?) | 2022-07-18 | Paper |
Regular model checking with regular relations
(available as arXiv preprint) | 2022-05-20 | Paper |
Regular transducer expressions for regular transformations
Information and Computation | 2022-01-06 | Paper |
One-way resynchronizability of word transducers
(available as arXiv preprint) | 2021-10-18 | Paper |
| The decidability of verification under PS 2.0 | 2021-10-18 | Paper |
| Logics meet 1-clock alternating timed automata | 2021-08-04 | Paper |
| Improved undecidability results for reachability games on recursive timed automata | 2021-06-24 | Paper |
Improved undecidability results for reachability games on recursive timed automata
(available as arXiv preprint) | 2021-06-24 | Paper |
| A unifying approach to decide relations for timed automata and their game characterization | 2021-06-09 | Paper |
A unifying approach to decide relations for timed automata and their game characterization
(available as arXiv preprint) | 2021-06-09 | Paper |
Regular and First-Order List Functions
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Regular and First-Order List Functions
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Regular transducer expressions for regular transformations
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Towards an Efficient Tree Automata based technique for Timed Systems
(available as arXiv preprint) | 2020-05-27 | Paper |
Making Metric Temporal Logic Rational
(available as arXiv preprint) | 2020-05-26 | Paper |
On timed scope-bounded context-sensitive languages
(available as arXiv preprint) | 2019-10-15 | Paper |
| Perfect timed communication is hard | 2018-12-06 | Paper |
Analyzing timed systems using tree automata
(available as arXiv preprint) | 2018-05-30 | Paper |
scientific article; zbMATH DE number 6862072 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
FO-definable transformations of infinite strings
(available as arXiv preprint) | 2018-04-19 | Paper |
Stochastic timed games revisited
(available as arXiv preprint) | 2018-03-21 | Paper |
| Analyzing Timed Systems Using Tree Automata | 2018-03-21 | Paper |
Further results on generalised communicating P systems
Theoretical Computer Science | 2017-12-06 | Paper |
Revisiting robustness in priced timed games
(available as arXiv preprint) | 2017-07-13 | Paper |
What's decidable about recursive hybrid automata?
Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control | 2017-05-19 | Paper |
Bounded-rate multi-mode systems based motion planning
Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control | 2017-05-19 | Paper |
First-order definable string transformations
(available as arXiv preprint) | 2017-04-25 | Paper |
A perfect class of context-sensitive timed languages
Developments in Language Theory | 2016-08-30 | Paper |
Metric temporal logic with counting
Lecture Notes in Computer Science | 2016-06-10 | Paper |
A logical characterization for dense-time visibly pushdown automata
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
Language and Automata Theory and Applications | 2016-04-08 | Paper |
On pure Nash equilibria in stochastic games
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Weak singular hybrid automata
Lecture Notes in Computer Science | 2015-08-06 | Paper |
On Unary Fragments of MTL and TPTL over Timed Words
Theoretical Aspects of Computing – ICTAC 2014 | 2015-01-13 | Paper |
Adding negative prices to priced timed games
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Some classes of generalised communicating P systems and simple kernel P systems
Lecture Notes in Computer Science | 2013-08-05 | Paper |
On the computability power of membrane systems with controlled mobility
Lecture Notes in Computer Science | 2012-08-14 | Paper |
On Restricted Bio-Turing Machines
Fundamenta Informaticae | 2011-11-22 | Paper |
On construction of safety signal automata for \(\mathrm{MITL}[\mathcal{U},\mathcal{S}]\) using temporal projections
Lecture Notes in Computer Science | 2011-10-07 | Paper |
Computability power of mobility in enhanced mobile membranes
Models of Computation in Context | 2011-09-09 | Paper |
A \(\Sigma_2^{\mathrm P} \cup \Pi_2^{\mathrm P}\) lower bound using mobile membranes
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
Enhanced mobile membranes: computability results
Theory of Computing Systems | 2011-05-23 | Paper |
Model checking weighted integer reset timed automata
Theory of Computing Systems | 2011-05-23 | Paper |
Model checking logic WCTL with multi constrained modalities on one clock priced timed automata
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Communicating Distributed H Systems: Optimal Results with Efficient Ways of Communication
DNA Computing | 2009-04-02 | Paper |
Membrane computing with transport and embedded proteins
Theoretical Computer Science | 2009-03-02 | Paper |
Timed Automata with Integer Resets: Language Inclusion and Expressiveness
Lecture Notes in Computer Science | 2008-12-02 | Paper |
The Expressiveness of Concentration Controlled P Systems
Unconventional Computing | 2008-12-02 | Paper |
On the Computational Power of Enhanced Mobile Membranes
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Updatable Timed Automata with Additive and Diagonal Constraints
Logic and Theory of Algorithms | 2008-06-19 | Paper |
| An infinite hierarchy for some variants of P systems | 2007-12-11 | Paper |
| On the efficiency of a variant of P systems with mobile membranes | 2007-12-11 | Paper |
On Pure Catalytic P Systems
Lecture Notes in Computer Science | 2007-11-29 | Paper |
On the Power of Bio-Turing Machines
Lecture Notes in Computer Science | 2007-11-29 | Paper |
On the Computational Power of Flip-Flop Proteins on Membranes
Lecture Notes in Computer Science | 2007-11-13 | Paper |
On Sampling Abstraction of Continuous Time Logic with Durations
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Universality results for P systems based on brane calculi operations
Theoretical Computer Science | 2007-03-12 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
P systems with mobile membranes
Natural Computing | 2006-06-12 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Membrane Computing
Lecture Notes in Computer Science | 2005-09-14 | Paper |
| scientific article; zbMATH DE number 2182433 (Why is no real title available?) | 2005-06-23 | Paper |
Results on catalytic and evolution-communication P systems
New Generation Computing | 2005-02-11 | Paper |
| scientific article; zbMATH DE number 2087035 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2013810 (Why is no real title available?) | 2003-12-07 | Paper |
| scientific article; zbMATH DE number 1951592 (Why is no real title available?) | 2003-07-21 | Paper |
On Some Classes Of Contextual Grammars
International Journal of Computer Mathematics | 2003-07-13 | Paper |
Breaking DES using P systems.
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1740165 (Why is no real title available?) | 2002-05-14 | Paper |
| scientific article; zbMATH DE number 1735640 (Why is no real title available?) | 2002-04-29 | Paper |
P systems with picture objects
Acta Cybernetica | 2002-02-13 | Paper |
A note on parallel rewriting in P systems
Bulletin of the European Association for Theoretical Computer Science EATCS | 2001-07-18 | Paper |
On power of p systems using sequential and parallel rewriting
International Journal of Computer Mathematics | 2001-01-29 | Paper |
An efficient quantifier elimination procedure for Presburger arithmetic
(available as arXiv preprint) | N/A | Paper |
