Publications : Paul GASTIN

[GMS20]

P. Gastin, S. Mukherjee, and B. Srivathsan. Reachability for updatable timed automata made faster and more effective. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 47:1--47:17, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.47.
[ BibTex | DOI | Web page | PDF ]

[AG20]

C. Aiswarya and P. Gastin. Weighted Tiling Systems for Graphs: Evaluation Complexity. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.34.
[ BibTex | DOI | Web page | PDF ]

[AGSW20]

B. Adsul, P. Gastin, S. Sarkar, and P. Weil. Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), volume 171 of Leibniz International Proceedings in Informatics, pages 19:1--19:17, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2020.19.
[ BibTex | DOI | Web page ]

[DTFG20]

G. Douéneau-Tabot, E. Filiot, and P. Gastin. Register transducers are marble transducers. In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS'20), volume 170 of Leibniz International Proceedings in Informatics, pages 29:1--29:14, Prague, Czech Republic, August 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.MFCS.2020.29.
[ BibTex | DOI | Web page | PDF ]

[AGKR20]

S. Akshay, P. Gastin, S. N. Krishna, and S. Roychoudhary. Revisiting Underapproximate Reachability for Multipushdown Systems. In Proceedings of the 26th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'20), volume 12078 of Lecture Notes in Computer Science, pages 387--404, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45190-5_21.
[ BibTex | DOI | Web page | PDF ]

[GMG20]

P. Gastin, A. Manuel, and R. Govind. Reversible Regular Languages: Logical and Algebraic Characterisations. Fundamenta Informaticae, 2020. To appear.
[ BibTex ]

[DGK20]

V. Dave, P. Gastin, and S. N. Krishna. Regular Transducer Expressions for Regular Transformations. Information and Computation, 2020.
[ BibTex | Web page | PDF ]

[BFG20]

B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines, First-Order Logic, and Star-Free Propositional Dynamic Logic. Journal of Computer and System Sciences, pages 22--53, 2020.
doi: 10.1016/j.jcss.2020.06.006.
[ BibTex | DOI | PDF ]

[CG19]

A. Chattopadhyay and P. Gastin, editors. Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'19), Leibniz International Proceedings in Informatics, Bombay, India, December 2019. Leibniz-Zentrum für Informatik.
[ BibTex | Web page ]

[GMG19]

P. Gastin, A. Manuel, and R. Govind. Logics for Reversible Regular Languages and Semigroups with Involution. In Proceedings of the 23th International Conference on Developments in Language Theory (DLT'19), volume 11647 of Lecture Notes in Computer Science, pages 182--191, Warsaw, Poland, August 2019. Springer.
doi: 10.1007/978-3-030-24886-4_13.
[ BibTex | DOI | Web page | PDF ]

[DG19]

M. Droste and P. Gastin. Aperiodic Weighted Automata and Weighted First-Order Logic. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'19), volume 138 of Leibniz International Proceedings in Informatics, pages 76:1--76:15, Aachen, Germany, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2019.76.
[ BibTex | DOI | Web page | PDF ]

[GMS19]

P. Gastin, S. Mukherjee, and B. Srivathsan. Fast algorithms for handling diagonal constraints in timed automata. In Proceedings of the 31st International Conference on Computer Aided Verification (CAV'19), volume 11561 of Lecture Notes in Computer Science, pages 41--59, New York, USA, July 2019. Springer.
doi: 10.1007/978-3-030-25540-4_3.
[ BibTex | DOI | Web page | PDF ]

[Gas19]

P. Gastin. Modular Descriptions of Regular Functions. In Proceedings of the 8th International Conference on Algebraic Informatics (CAI'19), volume 11545 of Lecture Notes in Computer Science, pages 3--9, Nis, Serbia, June 2019. Springer. Invited talk.
doi: 10.1007/978-3-030-21363-3_1.
[ BibTex | DOI | PDF ]

[AGJK19]

S. Akshay, P. Gastin, V. Jugé, and S. N. Krishna. Timed systems through the lens of logic. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785684.
[ BibTex | DOI | Web page | PDF ]

[GMS18]

P. Gastin, S. Mukherjee, and B. Srivathsan. Reachability in timed automata with diagonal constraints. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR'18), volume 118 of Leibniz International Proceedings in Informatics, pages 28:1--28:17, Beijing, China, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2018.28.
[ BibTex | DOI | Web page | PDF ]

[BFG18b]

B. Bollig, M. Fortin, and P. Gastin. It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with ”Happened Before”. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR'18), volume 118 of Leibniz International Proceedings in Informatics, pages 7:1--7:17, Beijing, China, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2018.7.
[ BibTex | DOI | Web page | PDF ]

[DGK18]

V. Dave, P. Gastin, and S. N. Krishna. Regular Transducer Expressions for Regular Transformations. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'18), pages 315--324, Oxford, UK, July 2018. ACM Press.
doi: 10.1145/3209108.3209182.
[ BibTex | DOI | Web page | PDF ]

[AGK18]

S. Akshay, P. Gastin, and S. N. Krishna. Analyzing Timed Systems Using Tree Automata. Logical Methods in Computer Science, 14(2):1--35, May 2018.
doi: 10.23638/LMCS-14(2:8)2018.
[ BibTex | DOI | Web page | PDF ]

[ABG18]

C. Aiswarya, B. Bollig, and P. Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. Information and Computation, 259:305--327, April 2018.
doi: 10.1016/j.ic.2017.05.006.
[ BibTex | DOI | PDF ]

[BFG18a]

B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines and Two-Variable Logic. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 17:1--17:14, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.17.
[ BibTex | DOI | Web page | PDF ]

[GM18]

P. Gastin and B. Monmege. A unifying survey on weighted logics and weighted automata. Soft Computing, 22(4):1047--1065, February 2018.
doi: 10.1007/s00500-015-1952-6.
[ BibTex | DOI | Web page | PDF ]

[AGKS17]

S. Akshay, P. Gastin, S. N. Krishna, and I. Sarkar. Towards an Efficient Tree Automata based technique for Timed Systems. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR'17), volume 85 of Leibniz International Proceedings in Informatics, pages 39:1--39:15, Berlin, Germany, September 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2017.39.
[ BibTex | DOI | Web page | PDF ]

[AGK16]

S. Akshay, P. Gastin, and S. N. Krishna. Analyzing Timed Systems Using Tree Automata. In Proceedings of the 27th International Conference on Concurrency Theory (CONCUR'16), volume 59 of Leibniz International Proceedings in Informatics, pages 27:1--27:14, Québec City, Canada, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2016.27.
[ BibTex | DOI | Web page | PDF ]

[FG16]

M. Fortin and P. Gastin. Verification of parameterized communicating automata via split-width. In Proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'16), volume 9634 of Lecture Notes in Computer Science, pages 197--213, Eindhoven, The Netherlands, April 2016. Springer.
doi: 10.1007/978-3-662-49630-5_12.
[ BibTex | DOI | Web page | PDF ]

[ABG15]

C. Aiswarya, B. Bollig, and P. Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of Leibniz International Proceedings in Informatics, pages 340--353, Madrid, Spain, September 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2015.340.
[ BibTex | DOI | Web page | PDF ]

[AGMK15]

S. Akshay, P. Gastin, M. Mukund, and K. N. Kumar. Checking conformance for time-constrained scenario-based specifications. Theoretical Computer Science, 594:24--43, August 2015.
doi: 10.1016/j.tcs.2015.03.030.
[ BibTex | DOI | Web page | PDF ]

[AG14]

C. Aiswarya and P. Gastin. Reasoning about distributed systems: WYSIWYG. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 11--30, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.11.
[ BibTex | DOI | Web page | PDF ]

[BGK14]

B. Bollig, P. Gastin, and A. Kumar. Parameterized Communicating Automata: Complementation and Model Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 625--637, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.625.
[ BibTex | DOI | Web page | PDF ]

[BCGZ14]

B. Bollig, A. Cyriac, P. Gastin, and M. Zeitoun. Temporal logics for concurrent recursive programs: Satisfiability and model checking. Journal of Applied Logic, 12(4):395--416, December 2014.
doi: 10.1016/j.jal.2014.05.001.
[ BibTex | DOI | Web page | PDF ]

[AGNK14]

C. Aiswarya, P. Gastin, and K. Narayan Kumar. Verifying Communicating Multi-pushdown Systems via Split-width. In Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), volume 8837 of Lecture Notes in Computer Science, pages 1--17, Sydney, Australia, November 2014. Springer.
doi: 10.1007/978-3-319-11936-6_1.
[ BibTex | DOI | Web page | PDF ]

[BGS14]

B. Bollig, P. Gastin, and J. Schubert. Parameterized Verification of Communicating Automata under Context Bounds. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 45--57, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_4.
[ BibTex | DOI | Web page | PDF ]

[CGNK14]

A. Cyriac, P. Gastin, and K. Narayan Kumar. Controllers for the Verification of Communicating Multi-Pushdown Systems. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), volume 8704 of Lecture Notes in Computer Science, pages 297--311, Rome, Italy, September 2014. Springer.
doi: 10.1007/978-3-662-44584-6_21.
[ BibTex | DOI | Web page | PDF ]

[BGMZ14a]

B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Logical Characterization of Weighted Pebble Walking Automata. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/ IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, July 2014. ACM Press.
doi: 10.1145/2603088.2603118.
[ BibTex | DOI | Web page | PDF ]

[GM14]

P. Gastin and B. Monmege. Adding Pebbles to Weighted Automata -- Easy Specification & Efficient Evaluation. Theoretical Computer Science, 534:24--44, May 2014.
doi: 10.1016/j.tcs.2014.02.034.
[ BibTex | DOI | Web page | PDF ]

[ABG⁺14]

S. Akshay, B. Bollig, P. Gastin, M. Mukund, and K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. Fundamenta Informaticae, 130(4):377--407, April 2014.
doi: 10.3233/FI-2014-996.
[ BibTex | DOI | Web page | PDF ]

[BGMZ14b]

B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Pebble Weighted Automata and Weighted Logics. ACM Transactions on Computational Logic, 15(2:15), April 2014.
doi: 10.1145/2579819.
[ BibTex | DOI | Web page | PDF ]

[ABG13]

S. Akshay, B. Bollig, and P. Gastin. Event-clock Message Passing Automata: A Logical Characterization and an Emptiness-Checking Algorithm. Formal Methods in System Design, 42(3):262--300, June 2013.
doi: 10.1007/s10703-012-0179-8.
[ BibTex | DOI | Web page | PDF ]

[GS13]

P. Gastin and N. Sznajder. Fair Synthesis for Asynchronous Distributed Systems. ACM Transactions on Computational Logic, 14(2:9), June 2013.
doi: 10.1145/2480759.2480761.
[ BibTex | DOI | Web page | PDF ]

[BGM13]

B. Bollig, P. Gastin, and B. Monmege. Weighted Specifications over Nested Words. In Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), volume 7794 of Lecture Notes in Computer Science, pages 385--400, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37075-5_25.
[ BibTex | DOI | Web page | PDF ]

[GS12]

P. Gastin and N. Sznajder. Decidability of well-connectedness for distributed synthesis. Information Processing Letters, 112(24):963--968, December 2012.
doi: 10.1016/j.ipl.2012.08.018.
[ BibTex | DOI | Web page | PDF ]

[BGMZ12]

B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. A Probabilistic Kleene Theorem. In Proceedings of the 10th International Symposium on Automated Technology for Verification and Analysis (ATVA'12), volume 7561 of Lecture Notes in Computer Science, pages 400--415, Thiruvananthapuram, India, October 2012. Springer.
doi: 10.1007/978-3-642-33386-6_31.
[ BibTex | DOI | Web page | PDF ]

[CGNK12]

A. Cyriac, P. Gastin, and K. Narayan Kumar. MSO Decidability of Multi-Pushdown Systems via Split-Width. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 547--561, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_38.
[ BibTex | DOI | Web page | PDF ]

[DG12]

S. Demri and P. Gastin. Specification and Verification using Temporal Logics. In Modern applications of automata theory, volume 2 of IISc Research Monographs, chapter 15, pages 457--494. World Scientific, July 2012.
[ BibTex | Web page | PDF ]

[GM12]

P. Gastin and B. Monmege. Adding Pebbles to Weighted Automata. In Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), volume 7381 of Lecture Notes in Computer Science, pages 28--51, Porto, Portugal, July 2012. Springer-Verlag.
doi: 10.1007/978-3-642-31606-7_4.
[ BibTex | DOI | Web page | PDF ]

[BCGNK12]

B. Bollig, A. Cyriac, P. Gastin, and K. Narayan Kumar. Model Checking Languages of Data Words. In Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'12), volume 7213 of Lecture Notes in Computer Science, pages 391--405, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28729-9_26.
[ BibTex | DOI | Web page | PDF ]

[BCGZ11]

B. Bollig, A. Cyriac, P. Gastin, and M. Zeitoun. Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), volume 6907 of Lecture Notes in Computer Science, pages 132--144, Warsaw, Poland, August 2011. Springer.
doi: 10.1007/978-3-642-22993-0_15.
[ BibTex | DOI | Web page | PDF ]

[BGMZ11]

B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Weighted Expressions and DFS Tree Automata. Research Report LSV-11-08, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2011. 32 pages.
[ BibTex | Web page | PDF ]

[AGMNK10]

S. Akshay, P. Gastin, M. Mukund, and K. Narayan Kumar. Model checking time-constrained scenario-based specifications. In Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), volume 8 of Leibniz International Proceedings in Informatics, pages 204--215, Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2010.204.
[ BibTex | DOI | Web page | PDF ]

[GL10]

P. Gastin and F. Laroussinie, editors. Proceedings of the 21st International Conference on Concurrency Theory (CONCUR'10), volume 6269 of Lecture Notes in Computer Science. Springer, August-September 2010.
doi: 10.1007/978-3-642-15375-4.
[ BibTex | DOI | Web page ]

[BGMZ10]

B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Pebble weighted automata and transitive closure logics. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) -- Part II, volume 6199 of Lecture Notes in Computer Science, pages 587--598, Bordeaux, France, July 2010. Springer.
doi: 10.1007/978-3-642-14162-1_49.
[ BibTex | DOI | Web page | PDF ]

[GK10]

P. Gastin and D. Kuske. Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Information and Computation, 208(7):797--816, July 2010.
doi: 10.1016/j.ic.2009.12.003.
[ BibTex | DOI | Web page | PDF ]

[BG09]

B. Bollig and P. Gastin. Weighted versus Probabilistic Logics. In Proceedings of the 13th International Conference on Developments in Language Theory (DLT'09), volume 5583 of Lecture Notes in Computer Science, pages 18--38, Stuttgart, Germany, June-July 2009. Springer.
doi: 10.1007/978-3-642-02737-6_2.
[ BibTex | DOI | Web page | PDF ]

[GSZ09]

P. Gastin, N. Sznajder, and M. Zeitoun. Distributed synthesis for well-connected architectures. Formal Methods in System Design, 34(3):215--237, June 2009.
doi: 10.1007/s10703-008-0064-7.
[ BibTex | DOI | Web page | PDF ]

[CGM⁺09]

Th. Chatain, P. Gastin, A. Muscholl, N. Sznajder, I. Walukiewicz, and M. Zeitoun. Distributed control for restricted specifications. Deliverable DOTS 2.2 (ANR-06-SETI-003), March 2009.
[ BibTex ]

[DG09b]

M. Droste and P. Gastin. Weighted automata and weighted logics. In Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, chapter 5, pages 175--211. Springer, 2009.
[ BibTex | Web page | PDF ]

[DG09a]

V. Diekert and P. Gastin. Local safety and local liveness for distributed systems. In Perspectives in Concurrency Theory, IARCS-Universities, pages 86--106. Universities Press, January 2009.
[ BibTex | Web page | PDF ]

[GMNK09]

P. Gastin, M. Mukund, and K. Narayan Kumar. Reachability and boundedness in time-constrained MSC graphs. In Perspectives in Concurrency Theory, IARCS-Universities, pages 157--183. Universities Press, January 2009.
[ BibTex | Web page | PDF ]

[CGS09]

Th. Chatain, P. Gastin, and N. Sznajder. Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. In Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09), volume 5404 of Lecture Notes in Computer Science, pages 141--152, Špindlerův Mlýn, Czech Republic, January 2009. Springer.
doi: 10.1007/978-3-540-95891-8_16.
[ BibTex | DOI | Web page | PDF ]

[BBC⁺08]

B. Bollig, P. Bouyer, F. Cassez, Th. Chatain, P. Gastin, S. Haddad, and C. Jard. Model for distributed timed systems. Deliverable DOTS 3.1 (ANR-06-SETI-003), September 2008.
[ BibTex ]

[ABG⁺08]

S. Akshay, B. Bollig, P. Gastin, M. Mukund, and K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, pages 82--97, Toronto, Canada, August 2008. Springer.
doi: 10.1007/978-3-540-85361-9_10.
[ BibTex | DOI | Web page | PDF ]

[DGK08]

V. Diekert, P. Gastin, and M. Kufleitner. A Survey on Small Fragments of First-Order Logic over Finite Words. International Journal of Foundations of Computer Science, 19(3):513--548, June 2008.
doi: 10.1142/S0129054108005802.
[ BibTex | DOI | Web page | PDF ]

[DG08b]

M. Droste and P. Gastin. On aperiodic and star-free formal power series in partially commuting variables. Theory of Computing Systems, 42(4):608--631, May 2008.
doi: 10.1007/s00224-007-9064-z.
[ BibTex | DOI | Web page | PS | PDF ]

[DG08a]

V. Diekert and P. Gastin. First-order definable languages. In Logic and Automata: History and Perspectives, volume 2 of Texts in Logic and Games, pages 261--306. Amsterdam University Press, 2008.
[ BibTex | Web page | PDF ]

[ABG07]

S. Akshay, B. Bollig, and P. Gastin. Automata and Logics for Timed Message Sequence Charts. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 290--302, New Delhi, India, December 2007. Springer.
doi: 10.1007/978-3-540-77050-3_24.
[ BibTex | DOI | Web page | PS | PDF ]

[GK07]

P. Gastin and D. Kuske. Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces. Fundamenta Informaticae, 80(1-3):169--197, November 2007.
[ BibTex | Web page | PDF ]

[Gas07a]

P. Gastin. Algorithmique. Course notes, Magistère STIC, ENS Cachan, France, November 2007.
[ BibTex ]

[BGP07]

B. Bérard, P. Gastin, and A. Petit. Timed substitutions for regular signal-event languages. Formal Methods in System Design, 31(2):101--134, October 2007.
doi: 10.1007/s10703-007-0034-5.
[ BibTex | DOI | Web page | PDF ]

[BGMNK07]

P. Bhateja, P. Gastin, M. Mukund, and K. Narayan Kumar. Local testing of message sequence charts is difficult. In Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT'07), volume 4639 of Lecture Notes in Computer Science, pages 76--87, Budapest, Hungary, August 2007. Springer.
doi: 10.1007/978-3-540-74240-1_8.
[ BibTex | DOI | Web page | PDF ]

[GO07]

P. Gastin and D. Oddoux. LTL2BA v1.1, August 2007. Written in C++ (about 4000 lines).
[ BibTex | Web page ]

[GM07]

P. Gastin and P. Moro. Minimal counter-example generation for SPIN. In Proceedings of the 14th International SPIN Workshop on Model Checking Software (SPIN'07), volume 4595 of Lecture Notes in Computer Science, pages 24--38, Berlin, Germany, July 2007. Springer.
doi: 10.1007/978-3-540-73370-6_4.
[ BibTex | DOI | Web page | PS | PDF ]

[DG07]

M. Droste and P. Gastin. Weighted automata and weighted logics. Theoretical Computer Science, 380(1-2):69--86, June 2007.
doi: 10.1016/j.tcs.2007.02.055.
[ BibTex | DOI | Web page | PS | PDF ]

[Gas07b]

P. Gastin. Langages formels. Course notes, Magistère STIC, ENS Cachan, France, May 2007.
[ BibTex ]

[Gas06c]

P. Gastin. Refinements and Abstractions of Signal-Event (Timed) Languages. Invited talk, Advances and Issues in Timed Systems, Kolkata, India, December 2006.
[ BibTex ]

[GSZ06]

P. Gastin, N. Sznajder, and M. Zeitoun. Distributed synthesis for well-connected architectures. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 321--332, Kolkata, India, December 2006. Springer.
doi: 10.1007/11944836_30.
[ BibTex | DOI | Web page | PDF ]

[DG06b]

V. Diekert and P. Gastin. Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Information and Computation, 204(11):1597--1619, November 2006.
doi: 10.1016/j.ic.2006.07.002.
[ BibTex | DOI | Web page | PDF ]

[Gas06b]

P. Gastin. GasT_EX: Graphs and Automata Simplified in T_EX (v2.8), November 2006. Written in T_EX(about 2000 lines).
[ BibTex | Web page ]

[BGM06]

P. Bhateja, P. Gastin, and M. Mukund. A fresh look at testing for asynchronous communication. In Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), volume 4218 of Lecture Notes in Computer Science, pages 369--383, Beijing, China, October 2006. Springer.
doi: 10.1007/11901914_28.
[ BibTex | DOI | Web page | PS | PDF ]

[G⁺06]

P. Gastin et al. ACI Sécurité Informatique VERSYDIS --- Rapport final, October 2006. 10 pages.
[ BibTex | Web page | PDF ]

[BGP06b]

B. Bérard, P. Gastin, and A. Petit. Refinements and abstractions of signal-event (timed) languages. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 67--81, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_6.
[ BibTex | DOI | Web page | PS | PDF ]

[BGP06a]

B. Bérard, P. Gastin, and A. Petit. Intersection of regular signal-event (timed) languages. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 52--66, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_5.
[ BibTex | DOI | Web page | PS | PDF ]

[Gas06a]

P. Gastin. Distributed synthesis: synchronous and asynchronous semantics. Invited talk, 34ème École de Printemps en Informatique Théorique, Ile de Ré, France, May 2006.
[ BibTex ]

[Gas06d]

P. Gastin. Refinements and Abstractions of Signal-Event (Timed) Languages. Invited talk, 22nd Conference on Mathematical Foundations of Programming Semantics (MFPS'06), May 2006.
[ BibTex ]

[DG06a]

V. Diekert and P. Gastin. From local to global temporal logics over Mazurkiewicz traces. Theoretical Computer Science, 356(1-2):126--135, May 2006.
doi: 10.1016/j.tcs.2006.01.035.
[ BibTex | DOI | Web page | PDF ]

[Gas06e]

P. Gastin. Weigthed logics and weighted automata. Invited talk, Workshop Weighted Automata: Theory and Applications, Leipzig, Germany, March 2006.
[ BibTex ]

[Gas05]

P. Gastin. On the synthesis of distributed controllers. Invited talk, Workshop Perspectives in Verification, in honor of Wolfgang Thomas on the occasion of his Doctorate Honoris Causa, Cachan, France, November 2005.
[ BibTex ]

[GK05]

P. Gastin and D. Kuske. Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), volume 3653 of Lecture Notes in Computer Science, pages 533--547, San Francisco, California, USA, August 2005. Springer.
doi: 10.1007/11539452_40.
[ BibTex | DOI | Web page | PS | PDF ]

[DG05]

M. Droste and P. Gastin. Weighted Automata and Weighted Logics. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), volume 3580 of Lecture Notes in Computer Science, pages 513--525, Lisboa, Portugal, July 2005. Springer.
doi: 10.1007/11523468_42.
[ BibTex | DOI | Web page | PS | PDF ]

[Gas04a]

P. Gastin. Basics of model checking. Invited tutorial, 6th Winter School on Modelling and Verifying Parallel Processes (MOVEP'04), Brussels, Belgium, December 2004.
[ BibTex ]

[GLZ04b]

P. Gastin, B. Lerman, and M. Zeitoun. Distributed games with causal memory are decidable for series-parallel systems. In Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04), volume 3328 of Lecture Notes in Computer Science, pages 275--286, Chennai, India, December 2004. Springer.
[ BibTex | Web page | PS | PDF ]

[DG04a]

V. Diekert and P. Gastin. Local temporal logic is expressively complete for cograph dependence alphabets. Information and Computation, 195(1-2):30--52, November 2004.
doi: 10.1016/j.ic.2004.08.001.
[ BibTex | DOI | Web page | PS | PDF ]

[Gas04b]

P. Gastin. Specifications for distributed systems. Invited lecture, 32nd Spring School on Theoretical Computer Science (Concurrency Theory), Luminy, France, April 2004.
[ BibTex ]

[GMZ04]

P. Gastin, P. Moro, and M. Zeitoun. Minimization of counterexamples in SPIN. In Proceedings of the 11th International SPIN Workshop on Model Checking Software (SPIN'04), volume 2989 of Lecture Notes in Computer Science, pages 92--108, Barcelona, Spain, April 2004. Springer.
[ BibTex | Web page | PS | PDF ]

[GLZ04a]

P. Gastin, B. Lerman, and M. Zeitoun. Distributed games and distributed control for asynchronous systems. In Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN'04), volume 2976 of Lecture Notes in Computer Science, pages 455--465, Buenos Aires, Argentina, April 2004. Springer.
[ BibTex | Web page | PS | PDF ]

[DG04b]

V. Diekert and P. Gastin. Pure future local temporal logics are expressively complete for Mazurkiewicz traces. In Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN'04), volume 2976 of Lecture Notes in Computer Science, pages 232--241, Buenos Aires, Argentina, April 2004. Springer.
[ BibTex | Web page | PS | PDF ]

[GM04]

P. Gastin and M. W. Mislove. A simple process algebra based on atomic actions with resources. Mathematical Structures in Computer Science, 14(1):1--55, February 2004.
doi: 10.1017/S0960129503003943.
[ BibTex | DOI | Web page | PS ]

[GK03]

P. Gastin and D. Kuske. Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. In Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03), volume 2761 of Lecture Notes in Computer Science, pages 222--236, Marseilles, France, August 2003. Springer.
[ BibTex | Web page | PS ]

[GMNK03]

P. Gastin, M. Mukund, and K. Narayan Kumar. Local LTL with past constants is expressively complete for Mazurkiewicz traces. In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS'03), volume 2747 of Lecture Notes in Computer Science, pages 429--438, Bratislava, Slovakia, August 2003. Springer.
[ BibTex | Web page | PS ]

[GO03]

P. Gastin and D. Oddoux. LTL with past and two-way very-weak alternating automata. In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS'03), volume 2747 of Lecture Notes in Computer Science, pages 439--448, Bratislava, Slovakia, August 2003. Springer.
[ BibTex | Web page | PS ]

[GM02b]

P. Gastin and M. Mukund. An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP'02), volume 2380 of Lecture Notes in Computer Science, pages 938--949, Málaga, Spain, July 2002. Springer.
[ BibTex | Web page | PS ]

[GM02a]

P. Gastin and M. W. Mislove. A truly concurrent semantics for a process algebra using resource pomsets. Theoretical Computer Science, 281(1-2):369--421, June 2002.
[ BibTex | Web page | PS ]

[GT02]

P. Gastin and D. Teodosiu. Resource traces: A domain for processes sharing exclusive resources. Theoretical Computer Science, 278(1-2):195--221, May 2002.
[ BibTex | Web page | PS ]

[DG02a]

V. Diekert and P. Gastin. LTL is expressively complete for Mazurkiewicz traces. Journal of Computer and System Sciences, 64(2):396--418, March 2002.
[ BibTex | Web page | PS ]

[DG02c]

M. Droste and P. Gastin. Selected papers of the workshop on Logic and Algebra in Concurrency, Dresden, Germany, September 2000. Journal of Automata, Languages and Combinatorics, 7(2), 2002.
[ BibTex ]

[DG02b]

V. Diekert and P. Gastin. Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. In Formal and Natural Computing --- Essays Dedicated to Grzegorz Rozenberg, volume 2300 of Lecture Notes in Computer Science, pages 26--38. Springer, 2002.
doi: 10.1007/3-540-45711-9_2.
[ BibTex | DOI | Web page | PS ]

[DG01b]

V. Diekert and P. Gastin. Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. In Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'01), volume 2250 of Lecture Notes in Artificial Intelligence, pages 55--69, Havana, Cuba, December 2001. Springer.
[ BibTex | Web page | PS ]

[GO01]

P. Gastin and D. Oddoux. Fast LTL to Büchi Automata Translation. In Proceedings of the 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of Lecture Notes in Computer Science, pages 53--65, Paris, France, July 2001. Springer.
[ BibTex | Web page | PS ]

[DG01a]

F. Derepas and P. Gastin. Model Checking Systems of Replicated Processes with SPIN. In Proceedings of the 8th International SPIN Workshop on Model Checking Software (SPIN'01), volume 2057 of Lecture Notes in Computer Science, pages 235--251, Toronto, Canada, May 2001. Springer.
[ BibTex | Web page | PS ]

[DGP01]

F. Derepas, P. Gastin, and D. Plainfossé. Avoiding state explosion for distributed systems with timestamps. In Formal Methods for Increasing Software Productivity --- Proceedings of the International Symposium of Formal Methods Europe (FME'01), volume 2021 of Lecture Notes in Computer Science, pages 119--134, Berlin, Germany, March 2001. Springer.
[ BibTex | Web page | PS ]

[DGK00]

M. Droste, P. Gastin, and D. Kuske. Asynchronous cellular automata for pomsets. Theoretical Computer Science, 247(1-2):1--38, September 2000.
[ BibTex | Web page | PS | PDF ]

[DG00a]

V. Diekert and P. Gastin. LTL is expressively complete for Mazurkiewicz traces. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 211--222, Geneva, Switzerland, July 2000. Springer.
[ BibTex | Web page | PS ]

[DG00b]

M. Droste and P. Gastin. On aperiodic and star-free formal power series in partially commuting variables. In Proceedings of the 12th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC'00), pages 158--169, Moscow, Russia, June 2000. Springer.
[ BibTex | Web page | PS ]

[GM99]

P. Gastin and M. W. Mislove. A truly concurrent semantics for a simple parallel programming language. In Selected Papers from the 13th International Workshop on Computer Science Logic (CSL'99), volume 1683 of Lecture Notes in Computer Science, pages 515--529, Madrid, Spain, September 1999. Springer.
[ BibTex | Web page | PS ]

[DG99a]

V. Diekert and P. Gastin. An expressively complete temporal logic without past tense operators for Mazurkiewicz traces. In Selected Papers from the 13th International Workshop on Computer Science Logic (CSL'99), volume 1683 of Lecture Notes in Computer Science, pages 188--203, Madrid, Spain, September 1999. Springer.
[ BibTex | Web page | PS ]

[DG99b]

M. Droste and P. Gastin. The Kleene-Schützenberger theorem for formal power series in partially commuting variables. 153(1):47--80, August 1999.
[ BibTex | Web page | PS ]

[BDGP98]

B. Bérard, V. Diekert, P. Gastin, and A. Petit. Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundamenta Informaticae, 36(2):145--182, November 1998.
[ BibTex | Web page | PS ]

[GMP98]

P. Gastin, R. Meyer, and A. Petit. A (non-elementary) modular decision procedure for LTrL. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98), volume 1450 of Lecture Notes in Computer Science, pages 356--365, Brno, Czech Republic, August 1998. Springer.
[ BibTex | Web page | PS ]

[AGP⁺98]

L. Albert, P. Gastin, B. Petazzoni, A. Petit, N. Puech, and P. Weil. Cours et exercices d'informatique, Classes préparatoires, premier et second cycles universitaires. Vuibert, June 1998.
[ BibTex ]

[DG98]

V. Diekert and P. Gastin. Approximating traces. Acta Informatica, 35(7):567--593, 1998.
[ BibTex | Web page | PS ]

[DG97b]

M. Droste and P. Gastin. On recognizable and rational formal power series in partially commuting variables. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), volume 1256 of Lecture Notes in Computer Science, pages 682--692, Bologna, Italy, July 1997. Springer.
[ BibTex | Web page | PS | PDF ]

[DGP97]

V. Diekert, P. Gastin, and A. Petit. Removing ε-Transitions in Timed Automata. In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS'97), volume 1200 of Lecture Notes in Computer Science, pages 583--594, Lübeck, Germany, February 1997. Springer.
[ BibTex | Web page | PS | PDF ]

[DG97a]

M. Droste and P. Gastin. Asynchronous cellular automata and logic for pomsets without auto-concurrency. Technical Report 97.24, Laboratoire d'Informatique Algorithmique, Fondements et Applications, Paris, France, 1997.
[ BibTex | Web page | PS | PDF ]

[DG96]

M. Droste and P. Gastin. Asynchronous cellular automata for Pomsets without auto-concurrency. In Proceedings of the 7th International Conference on Concurrency Theory (CONCUR'96), volume 1119 of Lecture Notes in Computer Science, pages 627--638, Pisa, Italy, August 1996. Springer.
[ BibTex | Web page | PS ]

[BGP96]

B. Bérard, P. Gastin, and A. Petit. On the Power of Non-Observable Actions in Timed Automata. In Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS'96), volume 1046 of Lecture Notes in Computer Science, pages 257--268, Grenoble, France, February 1996. Springer.
[ BibTex | Web page | PS ]

[DGP96]

V. Diekert, P. Gastin, and A. Petit. Recent Developments in Trace Theory. In Proceedings of the 2nd International Conference on Developments in Language Theory (DLT'95), pages 373--385, Magdeburg, Germany, 1996. World Scientific.
[ BibTex | Web page | PS ]

[GR95]

P. Gastin and J. Rutten. Selected papers of the workshop on Topology and Completion in Semantics, Chartes, France, November 1993. Theoretical Computer Science, 151(1), November 1995.
[ BibTex ]

[BG95]

S. Bauget and P. Gastin. On congruences and partial orders. In Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science (MFCS'95), volume 969 of Lecture Notes in Computer Science, pages 434--443, Prague, Czech Republic, August 1995. Springer.
[ BibTex | Web page | PS ]

[DG95]

V. Diekert and P. Gastin. A domain for concurrent termination: A generalization of Mazurkiewicz traces. In Proceedings of the 22th International Colloquium on Automata, Languages and Programming (ICALP'95), volume 944 of Lecture Notes in Computer Science, pages 15--26, Szeged, Hungary, July 1995. Springer-Verlag.
[ BibTex | Web page | PS ]

[GP95]

P. Gastin and A. Petit. Infinite traces. In The Book of Traces, chapter 11, pages 393--486. World Scientific, 1995.
[ BibTex ]

[DGP95]

V. Diekert, P. Gastin, and A. Petit. Rational and Recognizable Complex Trace Languages. Information and Computation, 116(1):134--153, January 1995.
[ BibTex | Web page | PS ]

[GPZ94]

P. Gastin, A. Petit, and W. Zielonka. An Extension of Kleene's and Ochmański's Theorems to Infinite Traces. Theoretical Computer Science, 125(2):167--204, March 1994.
[ BibTex | Web page | PS ]

[GV93]

P. Gastin and V. Villain. An efficient crash-tolerant sequential traversal. Parallel Processing Letters, 3:87--97, 1993.
[ BibTex ]

[GR93]

P. Gastin and B. Rozoy. The poset of infinitary traces. Theoretical Computer Science, 120(1):101--121, 1993.
[ BibTex | Web page | PS ]

[GOPR92]

P. Gastin, E. Ochmański, A. Petit, and B. Rozoy. Decidability of the star problem in A^*×{b}^*. Information Processing Letters, 44(2):65--71, November 1992.
[ BibTex | Web page | PS ]

[GP92b]

P. Gastin and A. Petit. PoSet properties of complex traces. In Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), volume 629 of Lecture Notes in Computer Science, pages 255--263, Prague, Czechoslovakia, August 1992. Springer-Verlag.
[ BibTex | Web page | PS ]

[GP92a]

P. Gastin and A. Petit. Asynchronous Cellular Automata for Infinite Traces. In Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP'92), volume 623 of Lecture Notes in Computer Science, pages 583--594, Vienna, Austria, July 1992. Springer-Verlag.
[ BibTex | Web page | PS ]

[GP92c]

P. Gastin and A. Petit. A Survey of Recognizable Languages of Infinite Traces. In Advances in Petri Nets 1992: The DEMON Project, volume 609 of Lecture Notes in Computer Science, pages 392--409. Springer-Verlag, 1992.
[ BibTex | Web page | PS ]

[Gas92]

P. Gastin. Mémoire d'habilitation à diriger des recherches. Mémoire d'habilitation, Université Paris 6, Paris, France, 1992.
[ BibTex ]

[DGP91]

V. Diekert, P. Gastin, and A. Petit. Recognizable Complex Trace Languages. In Proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science (MFCS'91), volume 520 of Lecture Notes in Computer Science, pages 131--140, Kazimierz Dolny, Poland, September 1991. Springer-Verlag.
[ BibTex | Web page | PS ]

[GPZ91]

P. Gastin, A. Petit, and W. Zielonka. A Kleene Theorem for Infinite Trace Languages. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP'91), volume 510 of Lecture Notes in Computer Science, pages 254--266, Madrid, Spain, July 1991. Springer-Verlag.
[ BibTex | Web page | PS ]

[Gas91]

P. Gastin. Recognizable and rational languages of finite and infinite traces. In Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS'91), volume 480 of Lecture Notes in Computer Science, pages 89--104, Hamburg, Germany, February 1991. Springer-Verlag.
[ BibTex ]

[BGV91]

J. Beauquier, P. Gastin, and V. Villain. A linear fault-tolerant naming algorithm. In Proceedings of the 4th International Workshop on Distributed Algorithms (WDAG'90), volume 486 of Lecture Notes in Computer Science, pages 57--70, Bari, Italy, 1991. Springer.
doi: 10.1007/3-540-54099-7_5.
[ BibTex | DOI ]

[Gas90a]

P. Gastin. Infinite Traces. In Semantics of Systems of Concurrent Processes --- Proceedings of the LITP Spring School on Theoretical Computer Science, volume 469 of Lecture Notes in Computer Science, pages 277--308, La Roche Posay, France, April 1990. Springer.
[ BibTex ]

[Gas90b]

P. Gastin. Un modèle asynchrone pour les systèmes distribués. Theoretical Computer Science, 74(1):121--161, 1990.
[ BibTex ]

[Gas87]

P. Gastin. Un modèle distribué. Thèse de doctorat, Laboratoire d'Informatique Théorique et Programmation, Paris, France, 1987.
[ BibTex ]

This file was generated by bibtex2html 1.98.