3 citations · 4 across the 4 of their papers we have counts for
21 papers
Efficient Construction of Reversible Transducers from Regular Transducer Expressions
Luc Dartois, Paul Gastin, R. Govind +1
The class of regular transformations has several equivalent characterizations such as functional MSO transductions, deterministic two-way transducers, streaming string transducers,…
Fast zone-based algorithms for reachability in pushdown timed automata
S. Akshay, Paul Gastin, Karthik R Prakash
Given the versatility of timed automata a huge body of work has evolved that considers extensions of timed automata. One extension that has received a lot of interest is timed auto…
SD-Regular Transducer Expressions for Aperiodic Transformations
Luc Dartois, Paul Gastin, Shankara Narayanan Krishna
FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order definable functions. In t…
Weighted Tiling Systems for Graphs: Evaluation Complexity
C. Aiswarya, Paul Gastin
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes…
Reachability for Updatable Timed Automata made faster and more effective
Paul Gastin, Sayan Mukherjee, B Srivathsan
Updatable timed automata (UTA) are extensions of classic timed automata that allow special updates to clock variables, like x:= x - 1, x := y + 2, etc., on transitions. Reachabilit…
Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar +1
We develop a new algebraic framework to reason about languages of Mazurkiewicz traces. This framework supports true concurrency and provides a non-trivial generalization of the wre…