


Остановите войну!
for scientists:


default search action
Paul Gastin
Person information

- affiliation: ENS Paris-Saclay, France
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j41]Vrunda Dave, Paul Gastin
, Shankara Narayanan Krishna:
Regular transducer expressions for regular transformations. Inf. Comput. 282: 104655 (2022) - [j40]Bharat Adsul, Paul Gastin
, Saptarshi Sarkar, Pascal Weil:
Asynchronous wreath product and cascade decompositions for concurrent behaviours. Log. Methods Comput. Sci. 18(2) (2022) - [c83]Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi:
CONCUR Test-Of-Time Award 2022 (Invited Paper). CONCUR 2022: 1:1-1:3 - [c82]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
Simulations for Event-Clock Automata. CONCUR 2022: 13:1-13:18 - [c81]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. CONCUR 2022: 28:1-28:19 - [c80]Patricia Bouyer
, Paul Gastin
, Frédéric Herbreteau
, Ocan Sankur
, B. Srivathsan
:
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? FORMATS 2022: 16-42 - [c79]Luc Dartois, Paul Gastin
, R. Govind, Shankara Narayanan Krishna:
Efficient Construction of Reversible Transducers from Regular Transducer Expressions. LICS 2022: 50:1-50:13 - [i29]Luc Dartois, Paul Gastin, R. Govind, Shankara Narayanan Krishna:
Efficient Construction of Reversible Transducers from Regular Transducer Expressions. CoRR abs/2202.04340 (2022) - [i28]S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
Simulations for Event-Clock Automata. CoRR abs/2207.02633 (2022) - [i27]Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan:
Zone-based verification of timed automata: extrapolations, simulations and what next? CoRR abs/2207.07479 (2022) - 2021
- [j39]Paul Gastin
, Amaldev Manuel, R. Govind:
Reversible Regular Languages: Logical and Algebraic Characterisations. Fundam. Informaticae 180(4): 333-350 (2021) - [j38]Benedikt Bollig, Marie Fortin, Paul Gastin
:
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. J. Comput. Syst. Sci. 115: 22-53 (2021) - [c78]S. Akshay
, Paul Gastin
, Karthik R. Prakash
:
Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata. CAV (1) 2021: 619-642 - [c77]Luc Dartois, Paul Gastin
, Shankara Narayanan Krishna:
SD-Regular Transducer Expressions for Aperiodic Transformations. LICS 2021: 1-13 - [i26]Luc Dartois, Paul Gastin, Shankara Narayanan Krishna:
SD-Regular Transducer Expressions for Aperiodic Transformations. CoRR abs/2101.07130 (2021) - [i25]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Asynchronous wreath product and cascade decompositions for concurrent behaviours. CoRR abs/2105.10897 (2021) - [i24]S. Akshay, Paul Gastin, Karthik R. Prakash:
Fast zone-based algorithms for reachability in pushdown timed automata. CoRR abs/2105.13683 (2021) - 2020
- [c76]Bharat Adsul, Paul Gastin
, Saptarshi Sarkar, Pascal Weil:
Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. CONCUR 2020: 19:1-19:17 - [c75]C. Aiswarya
, Paul Gastin
:
Weighted Tiling Systems for Graphs: Evaluation Complexity. FSTTCS 2020: 34:1-34:17 - [c74]Paul Gastin
, Sayan Mukherjee
, B. Srivathsan
:
Reachability for Updatable Timed Automata Made Faster and More Effective. FSTTCS 2020: 47:1-47:17 - [c73]Gaëtan Douéneau-Tabot, Emmanuel Filiot
, Paul Gastin
:
Register Transducers Are Marble Transducers. MFCS 2020: 29:1-29:14 - [c72]S. Akshay, Paul Gastin
, Shankara Narayanan Krishna, Sparsa Roychowdhury
:
Revisiting Underapproximate Reachability for Multipushdown Systems. TACAS (1) 2020: 387-404 - [i23]S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Sparsa Roychowdhury:
Revisiting Underapproximate Reachability for Multipushdown Systems. CoRR abs/2002.05950 (2020) - [i22]Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin:
Register transducers are marble transducers. CoRR abs/2005.01342 (2020) - [i21]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version). CoRR abs/2007.07940 (2020) - [i20]Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Reachability for Updatable Timed Automata made faster and more effective. CoRR abs/2009.13260 (2020) - [i19]C. Aiswarya, Paul Gastin:
Weighted Tiling Systems for Graphs: Evaluation Complexity. CoRR abs/2009.14542 (2020)
2010 – 2019
- 2019
- [c71]Paul Gastin:
Modular Descriptions of Regular Functions. CAI 2019: 3-9 - [c70]Paul Gastin
, Sayan Mukherjee
, B. Srivathsan
:
Fast Algorithms for Handling Diagonal Constraints in Timed Automata. CAV (1) 2019: 41-59 - [c69]Paul Gastin, Amaldev Manuel, R. Govind:
Logics for Reversible Regular Languages and Semigroups with Involution. DLT 2019: 182-191 - [c68]S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna:
Timed Systems through the Lens of Logic. LICS 2019: 1-13 - [c67]Manfred Droste, Paul Gastin
:
Aperiodic Weighted Automata and Weighted First-Order Logic. MFCS 2019: 76:1-76:15 - [e3]Arkadev Chattopadhyay, Paul Gastin
:
39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, December 11-13, 2019, Bombay, India. LIPIcs 150, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-131-3 [contents] - [i18]Manfred Droste, Paul Gastin:
Aperiodic Weighted Automata and Weighted First-Order Logic. CoRR abs/1902.08149 (2019) - [i17]S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna:
Timed Systems through the Lens of Logic. CoRR abs/1903.03773 (2019) - [i16]Benedikt Bollig, Paul Gastin:
Non-Sequential Theory of Distributed Systems. CoRR abs/1904.06942 (2019) - [i15]Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Fast algorithms for handling diagonal constraints in timed automata. CoRR abs/1904.08590 (2019) - [i14]Paul Gastin, Amaldev Manuel, R. Govind:
Logics for Reversible Regular Languages and Semigroups with Involution. CoRR abs/1907.01214 (2019) - [i13]Paul Gastin:
Modular Descriptions of Regular Functions. CoRR abs/1908.01137 (2019) - 2018
- [j37]C. Aiswarya
, Benedikt Bollig, Paul Gastin:
An automata-theoretic approach to the verification of distributed algorithms. Inf. Comput. 259(3): 305-327 (2018) - [j36]S. Akshay, Paul Gastin, Shankara Narayanan Krishna:
Analyzing Timed Systems Using Tree Automata. Log. Methods Comput. Sci. 14(2) (2018) - [j35]Paul Gastin, Benjamin Monmege
:
A unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties. Soft Comput. 22(4): 1047-1065 (2018) - [c66]Benedikt Bollig, Marie Fortin, Paul Gastin:
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". CONCUR 2018: 7:1-7:17 - [c65]Paul Gastin, Sayan Mukherjee
, B. Srivathsan
:
Reachability in Timed Automata with Diagonal Constraints. CONCUR 2018: 28:1-28:17 - [c64]Vrunda Dave, Paul Gastin, Shankara Narayanan Krishna:
Regular Transducer Expressions for Regular Transformations. LICS 2018: 315-324 - [c63]Benedikt Bollig, Marie Fortin, Paul Gastin:
Communicating Finite-State Machines and Two-Variable Logic. STACS 2018: 17:1-17:14 - [i12]Vrunda Dave, Paul Gastin, Krishna Shankara Narayanan:
Regular Transducer Expressions for Regular Transformations. CoRR abs/1802.02094 (2018) - [i11]Benedikt Bollig, Marie Fortin, Paul Gastin:
Gossiping in Message-Passing Systems. CoRR abs/1802.08641 (2018) - [i10]Benedikt Bollig, Marie Fortin, Paul Gastin:
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". CoRR abs/1804.10076 (2018) - [i9]Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Reachability in timed automata with diagonal constraints. CoRR abs/1806.11007 (2018) - [i8]Paul Gastin, Shankara Narayanan Krishna:
Unambiguous Forest Factorization. CoRR abs/1810.07285 (2018) - 2017
- [c62]S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar:
Towards an Efficient Tree Automata Based Technique for Timed Systems. CONCUR 2017: 39:1-39:15 - [i7]S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar:
Towards an Efficient Tree Automata based technique for Timed Systems. CoRR abs/1707.02297 (2017) - [i6]Benedikt Bollig, Marie Fortin, Paul Gastin:
Communicating Finite-State Machines and Two-Variable Logic. CoRR abs/1709.09991 (2017) - 2016
- [c61]S. Akshay, Paul Gastin, Shankara Narayanan Krishna:
Analyzing Timed Systems Using Tree Automata. CONCUR 2016: 27:1-27:14 - [c60]Marie Fortin, Paul Gastin:
Verification of Parameterized Communicating Automata via Split-Width. FoSSaCS 2016: 197-213 - [i5]S. Akshay, Paul Gastin, Shankara Narayanan Krishna:
Analyzing Timed Systems Using Tree Automata. CoRR abs/1604.08443 (2016) - [i4]C. Aiswarya, Paul Gastin, Prakash Saivasan:
Nested Words for Order-2 Pushdown Systems. CoRR abs/1609.06290 (2016) - 2015
- [j34]S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Checking conformance for time-constrained scenario-based specifications. Theor. Comput. Sci. 594: 24-43 (2015) - [c59]C. Aiswarya
, Benedikt Bollig, Paul Gastin:
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CONCUR 2015: 340-353 - [i3]C. Aiswarya, Benedikt Bollig, Paul Gastin:
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CoRR abs/1504.06534 (2015) - 2014
- [j33]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. Fundam. Informaticae 130(4): 377-407 (2014) - [j32]Benedikt Bollig, C. Aiswarya
, Paul Gastin, Marc Zeitoun:
Temporal logics for concurrent recursive programs: Satisfiability and model checking. J. Appl. Log. 12(4): 395-416 (2014) - [j31]Paul Gastin, Benjamin Monmege
:
Adding pebbles to weighted automata: Easy specification & efficient evaluation. Theor. Comput. Sci. 534: 24-44 (2014) - [j30]Benedikt Bollig, Paul Gastin, Benjamin Monmege
, Marc Zeitoun:
Pebble Weighted Automata and Weighted Logics. ACM Trans. Comput. Log. 15(2): 15:1-15:35 (2014) - [c58]C. Aiswarya
, Paul Gastin, K. Narayan Kumar:
Verifying Communicating Multi-pushdown Systems via Split-Width. ATVA 2014: 1-17 - [c57]C. Aiswarya
, Paul Gastin, K. Narayan Kumar:
Controllers for the Verification of Communicating Multi-pushdown Systems. CONCUR 2014: 297-311 - [c56]Benedikt Bollig, Paul Gastin, Benjamin Monmege
, Marc Zeitoun:
Logical characterization of weighted pebble walking automata. CSL-LICS 2014: 19:1-19:10 - [c55]C. Aiswarya
, Paul Gastin:
Reasoning About Distributed Systems: WYSIWYG (Invited Talk). FSTTCS 2014: 11-30 - [c54]Benedikt Bollig, Paul Gastin, Akshay Kumar:
Parameterized Communicating Automata: Complementation and Model Checking. FSTTCS 2014: 625-637 - [c53]Benedikt Bollig, Paul Gastin, Jana Schubert:
Parameterized Verification of Communicating Automata under Context Bounds. RP 2014: 45-57 - 2013
- [j29]S. Akshay, Benedikt Bollig, Paul Gastin:
Event clock message passing automata: a logical characterization and an emptiness checking algorithm. Formal Methods Syst. Des. 42(3): 262-300 (2013) - [j28]Paul Gastin, Nathalie Sznajder:
Fair Synthesis for Asynchronous Distributed Systems. ACM Trans. Comput. Log. 14(2): 9:1-9:31 (2013) - [c52]Benedikt Bollig, Paul Gastin, Benjamin Monmege
:
Weighted Specifications over Nested Words. FoSSaCS 2013: 385-400 - 2012
- [j27]Paul Gastin, Nathalie Sznajder:
Decidability of well-connectedness for distributed synthesis. Inf. Process. Lett. 112(24): 963-968 (2012) - [c51]Benedikt Bollig, Paul Gastin, Benjamin Monmege
, Marc Zeitoun:
A Probabilistic Kleene Theorem. ATVA 2012: 400-415 - [c50]Aiswarya Cyriac
, Paul Gastin, K. Narayan Kumar:
MSO Decidability of Multi-Pushdown Systems via Split-Width. CONCUR 2012: 547-561 - [c49]Benedikt Bollig, Aiswarya Cyriac
, Paul Gastin, K. Narayan Kumar:
Model Checking Languages of Data Words. FoSSaCS 2012: 391-405 - [c48]Paul Gastin, Benjamin Monmege
:
Adding Pebbles to Weighted Automata. CIAA 2012: 28-51 - [p3]Stéphane Demri, Paul Gastin:
Specification and Verification using Temporal Logics. Modern Applications of Automata Theory 2012: 457-494 - 2011
- [c47]Benedikt Bollig, Aiswarya Cyriac
, Paul Gastin, Marc Zeitoun:
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. MFCS 2011: 132-144 - 2010
- [j26]Paul Gastin, Dietrich Kuske:
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Inf. Comput. 208(7): 797-816 (2010) - [c46]S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Model checking time-constrained scenario-based specifications. FSTTCS 2010: 204-215 - [c45]Benedikt Bollig, Paul Gastin, Benjamin Monmege
, Marc Zeitoun:
Pebble Weighted Automata and Transitive Closure Logics. ICALP (2) 2010: 587-598 - [e2]Paul Gastin, François Laroussinie:
CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings. Lecture Notes in Computer Science 6269, Springer 2010, ISBN 978-3-642-15374-7 [contents] - [e1]Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen:
Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010. Dagstuhl Seminar Proceedings 10031, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i2]Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen:
10031 Abstracts Collection - Quantitative Models: Expressiveness and Analysis. Quantitative Models: Expressiveness and Analysis 2010 - [i1]Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen:
10031 Executive Summary - Quantitative Models: Expressiveness and Analysis. Quantitative Models: Expressiveness and Analysis 2010
2000 – 2009
- 2009
- [j25]Paul Gastin, Nathalie Sznajder, Marc Zeitoun:
Distributed synthesis for well-connected architectures. Formal Methods Syst. Des. 34(3): 215-237 (2009) - [c44]Benedikt Bollig, Paul Gastin:
Weighted versus Probabilistic Logics. Developments in Language Theory 2009: 18-38 - [c43]Thomas Chatain, Paul Gastin, Nathalie Sznajder:
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. SOFSEM 2009: 141-152 - 2008
- [j24]Volker Diekert, Paul Gastin, Manfred Kufleitner
:
A Survey on Small Fragments of First-Order Logic over Finite Words. Int. J. Found. Comput. Sci. 19(3): 513-548 (2008) - [j23]Manfred Droste, Paul Gastin:
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables. Theory Comput. Syst. 42(4): 608-631 (2008) - [c42]Volker Diekert, Paul Gastin:
First-order definable languages. Logic and Automata 2008: 261-306 - [c41]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. CONCUR 2008: 82-97 - 2007
- [j22]Béatrice Bérard, Paul Gastin, Antoine Petit:
Timed substitutions for regular signal-event languages. Formal Methods Syst. Des. 31(2): 101-134 (2007) - [j21]Paul Gastin, Dietrich Kuske:
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. Fundam. Informaticae 80(1-3): 169-197 (2007) - [j20]Manfred Droste, Paul Gastin:
Weighted automata and weighted logics. Theor. Comput. Sci. 380(1-2): 69-86 (2007) - [c40]Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local Testing of Message Sequence Charts Is Difficult. FCT 2007: 76-87 - [c39]S. Akshay, Benedikt Bollig, Paul Gastin:
Automata and Logics for Timed Message Sequence Charts. FSTTCS 2007: 290-302 - [c38]Paul Gastin, Pierre Moro:
Minimal Counterexample Generation for SPIN. SPIN 2007: 24-38 - 2006
- [j19]Volker Diekert, Paul Gastin:
Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Inf. Comput. 204(11): 1597-1619 (2006) - [j18]Siva Anantharaman, Paul Gastin, Gaétan Hains, John Mullins, Michaël Rusinowitch:
Editorial. J. Autom. Lang. Comb. 11(1): 5-6 (2006) - [j17]Volker Diekert, Paul Gastin:
From local to global temporal logics over Mazurkiewicz traces. Theor. Comput. Sci. 356(1-2): 126-135 (2006) - [c37]Puneet Bhateja, Paul Gastin, Madhavan Mukund:
A Fresh Look at Testing for Asynchronous Communication. ATVA 2006: 369-383 - [c36]Béatrice Bérard, Paul Gastin, Antoine Petit:
Intersection of Regular Signal-Event (Timed) Languages. FORMATS 2006: 52-66 - [c35]Béatrice Bérard, Paul Gastin, Antoine Petit:
Refinements and Abstractions of Signal-Event (Timed) Languages. FORMATS 2006: 67-81 - [c34]Paul Gastin, Nathalie Sznajder, Marc Zeitoun:
Distributed Synthesis for Well-Connected Architectures. FSTTCS 2006: 321-332 - 2005
- [c33]Paul Gastin, Dietrich Kuske:
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. CONCUR 2005: 533-547 - [c32]Manfred Droste, Paul Gastin:
Weighted Automata and Weighted Logics. ICALP 2005: 513-525 - 2004
- [j16]Volker Diekert, Paul Gastin:
Local temporal logic is expressively complete for cograph dependence alphabets. Inf. Comput. 195(1-2): 30-52 (2004) - [j15]Paul Gastin, Michael W. Mislove
:
A simple process algebra based on atomic actions with resources. Math. Struct. Comput. Sci. 14(1): 1-55 (2004) - [c31]Paul Gastin, Benjamin Lerman, Marc Zeitoun:
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. FSTTCS 2004: 275-286 - [c30]Volker Diekert, Paul Gastin:
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. LATIN 2004: 232-241 - [c29]Paul Gastin, Benjamin Lerman, Marc Zeitoun:
Distributed Games and Distributed Control for Asynchronous Systems. LATIN 2004: 455-465 - [c28]Paul Gastin, Pierre Moro, Marc Zeitoun:
Minimization of Counterexamples in SPIN. SPIN 2004: 92-108 - 2003
- [c27]Paul Gastin, Dietrich Kuske:
Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. CONCUR 2003: 218-232 - [c26]Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. MFCS 2003: 429-438 - [c25]Paul Gastin, Denis Oddoux:
LTL with Past and Two-Way Very-Weak Alternating Automata. MFCS 2003: 439-448 - 2002
- [j14]Manfred Droste, Paul Gastin:
Editorial. J. Autom. Lang. Comb. 7(2): 165 (2002) - [j13]Volker Diekert, Paul Gastin:
LTL Is Expressively Complete for Mazurkiewicz Traces. J. Comput. Syst. Sci. 64(2): 396-418 (2002) - [j12]Paul Gastin, Dan Teodosiu:
Resource traces: a domain for processes sharing exclusive resources. Theor. Comput. Sci. 278(1-2): 195-221 (2002) - [j11]