10 citations · 44 across the 22 of their papers we have counts for
5 papers · 1 filter
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…
Register transducers are marble transducers
Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin
Deterministic two-way transducers define the class of regular functions from words to words. Alur and Cerný introduced an equivalent model of transducers with registers called copy…
Revisiting Underapproximate Reachability for Multipushdown Systems
S. Akshay, Paul Gastin, S Krishna +1
Boolean programs with multiple recursive threads can be captured as pushdown automata with multiple stacks. This model is Turing complete, and hence, one is often interested in ana…