Aiswarya, C.; Bollig, Benedikt; Gastin, Paul An automata-theoretic approach to the verification of distributed algorithms. (English) Zbl 1390.68421 Inf. Comput. 259, Part 3, 305-327 (2018). MSC: 68Q60 68Q45 68W15 PDFBibTeX XMLCite \textit{C. Aiswarya} et al., Inf. Comput. 259, Part 3, 305--327 (2018; Zbl 1390.68421) Full Text: DOI arXiv Link
Fortin, Marie; Gastin, Paul Verification of parameterized communicating automata via split-width. (English) Zbl 1475.68182 Jacobs, Bart (ed.) et al., Foundations of software science and computation structures. 19th international conference, FOSSACS 2016, held as part of the European joint conferences on theory and practice of software, ETAPS 2016, Eindhoven, The Netherlands, April 2–8, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9634, 197-213 (2016). MSC: 68Q60 68Q45 68Q85 PDFBibTeX XMLCite \textit{M. Fortin} and \textit{P. Gastin}, Lect. Notes Comput. Sci. 9634, 197--213 (2016; Zbl 1475.68182) Full Text: DOI HAL
Aiswarya, Cyriac; Bollig, Benedikt; Gastin, Paul An automata-theoretic approach to the verification of distributed algorithms. (English) Zbl 1374.68725 Aceto, Luca (ed.) et al., 26th international conference on concurrency theory, CONCUR’15, Madrid, Spain, September 1–4, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-91-0). LIPIcs – Leibniz International Proceedings in Informatics 42, 340-353 (2015). MSC: 68W15 68Q45 68Q60 PDFBibTeX XMLCite \textit{C. Aiswarya} et al., LIPIcs -- Leibniz Int. Proc. Inform. 42, 340--353 (2015; Zbl 1374.68725) Full Text: DOI
Akshay, S.; Gastin, Paul; Mukund, Madhavan; Kumar, K. Narayan Checking conformance for time-constrained scenario-based specifications. (English) Zbl 1328.68124 Theor. Comput. Sci. 594, 24-43 (2015). MSC: 68Q60 68Q45 PDFBibTeX XMLCite \textit{S. Akshay} et al., Theor. Comput. Sci. 594, 24--43 (2015; Zbl 1328.68124) Full Text: DOI
Bollig, Benedikt; Gastin, Paul; Kumar, Akshay Parameterized communicating automata: complementation and model checking. (English) Zbl 1360.68577 Raman, Venkatesh (ed.) et al., 34th international conference on foundation of software technology and theoretical computer science, FSTTCS 2014, New Delhi, India, December 15–17, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-77-4). LIPIcs – Leibniz International Proceedings in Informatics 29, 625-637 (2014). MSC: 68Q60 03D05 68Q45 68Q85 PDFBibTeX XMLCite \textit{B. Bollig} et al., LIPIcs -- Leibniz Int. Proc. Inform. 29, 625--637 (2014; Zbl 1360.68577) Full Text: DOI
Aiswarya, C.; Gastin, Paul; Narayan Kumar, K. Verifying communicating multi-pushdown systems via split-width. (English) Zbl 1448.68283 Cassez, Franck (ed.) et al., Automated technology for verification and analysis. 12th international symposium, ATVA 2014, Sydney, NSW, Australia, November 3–7, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8837, 1-17 (2014). MSC: 68Q60 68N30 68Q85 PDFBibTeX XMLCite \textit{C. Aiswarya} et al., Lect. Notes Comput. Sci. 8837, 1--17 (2014; Zbl 1448.68283) Full Text: DOI
Bollig, Benedikt; Gastin, Paul; Schubert, Jana Parameterized verification of communicating automata under context bounds. (English) Zbl 1448.68286 Ouaknine, Joël (ed.) et al., Reachability problems. 8th international workshop, RP 2014, Oxford, UK, September 22–24, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8762, 45-57 (2014). MSC: 68Q60 68Q17 68Q45 68Q85 PDFBibTeX XMLCite \textit{B. Bollig} et al., Lect. Notes Comput. Sci. 8762, 45--57 (2014; Zbl 1448.68286) Full Text: DOI
Bollig, Benedikt; Cyriac, Aiswarya; Gastin, Paul; Zeitoun, Marc Temporal logics for concurrent recursive programs: satisfiability and model checking. (English) Zbl 1310.68142 J. Appl. Log. 12, No. 4, 395-416 (2014). MSC: 68Q60 03B44 68N30 68Q85 PDFBibTeX XMLCite \textit{B. Bollig} et al., J. Appl. Log. 12, No. 4, 395--416 (2014; Zbl 1310.68142) Full Text: DOI
Aiswarya, C.; Gastin, Paul; Narayan Kumar, K. Controllers for the verification of communicating multi-pushdown systems. (English) Zbl 1417.68111 Baldan, Paolo (ed.) et al., CONCUR 2014 – concurrency theory. 25th international conference, CONCUR 2014, Rome, Italy, September 2–5, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8704, 297-311 (2014). MSC: 68Q85 68Q45 68Q60 PDFBibTeX XMLCite \textit{C. Aiswarya} et al., Lect. Notes Comput. Sci. 8704, 297--311 (2014; Zbl 1417.68111) Full Text: DOI
Gastin, Paul; Sznajder, Nathalie Fair synthesis for asynchronous distributed systems. (English) Zbl 1353.68202 ACM Trans. Comput. Log. 14, No. 2, Article No. 9, 31 p. (2013). MSC: 68Q85 68Q60 PDFBibTeX XMLCite \textit{P. Gastin} and \textit{N. Sznajder}, ACM Trans. Comput. Log. 14, No. 2, Article No. 9, 31 p. (2013; Zbl 1353.68202) Full Text: DOI
Akshay, S.; Bollig, Benedikt; Gastin, Paul Event clock message passing automata: a logical characterization and an emptiness checking algorithm. (English) Zbl 1291.68239 Form. Methods Syst. Des. 42, No. 3, 262-300 (2013). MSC: 68Q60 68Q45 03B70 03B15 PDFBibTeX XMLCite \textit{S. Akshay} et al., Form. Methods Syst. Des. 42, No. 3, 262--300 (2013; Zbl 1291.68239) Full Text: DOI
Bollig, Benedikt; Gastin, Paul; Monmege, Benjamin Weighted specifications over nested words. (English) Zbl 1260.68228 Pfenning, Frank (ed.), Foundations of software science and computation structures. 16th international conference, FOSSACS 2013, held as part of the European joint conferences on theory and practice of software, ETAPS 2013, Rome, Italy, March 16–24, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-37074-8/pbk). Lecture Notes in Computer Science 7794, 385-400 (2013). MSC: 68Q60 68P05 68Q45 PDFBibTeX XMLCite \textit{B. Bollig} et al., Lect. Notes Comput. Sci. 7794, 385--400 (2013; Zbl 1260.68228) Full Text: DOI
Demri, Stéphane; Gastin, Paul Specification and verification using temporal logics. (English) Zbl 1256.68101 D’Souza, Deepak (ed.) et al., Modern applications of automata theory. Dedicated to the memory of Professor Priti Shankar. Foreword by Reinhard Wilhelm. Hackensack, NJ: World Scientific; Bangalore: IISc Press (ISBN 978-981-4271-04-2/hbk; 978-981-4271-05-9/ebook). IISc Research Monographs Series 2, 457-493 (2012). MSC: 68Q45 03D05 03B44 68Q60 PDFBibTeX XMLCite \textit{S. Demri} and \textit{P. Gastin}, IISc Res. Monogr. Ser. 2, 457--493 (2012; Zbl 1256.68101) Full Text: DOI
Bollig, Benedikt; Cyriac, Aiswarya; Gastin, Paul; Narayan Kumar, K. Model checking languages of data words. (English) Zbl 1352.68145 Birkedal, Lars (ed.), Foundations of software science and computational structures. 15th international conference, FOSSACS 2012, held as part of the European joint conferences on theory and practice of software, ETAPS 2012, Tallinn, Estonia, March 24 – April 1, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28728-2/pbk). Lecture Notes in Computer Science 7213, 391-405 (2012). MSC: 68Q60 03B25 68Q45 68Q85 PDFBibTeX XMLCite \textit{B. Bollig} et al., Lect. Notes Comput. Sci. 7213, 391--405 (2012; Zbl 1352.68145) Full Text: DOI
Bollig, Benedikt; Cyriac, Aiswarya; Gastin, Paul; Zeitoun, Marc Temporal logics for concurrent recursive programs: satisfiability and model checking. (English) Zbl 1343.68055 Murlak, Filip (ed.) et al., Mathematical foundations of computer science 2011. 36th international symposium, MFCS 2011, Warsaw, Poland, August 22–26, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22992-3/pbk). Lecture Notes in Computer Science 6907, 132-144 (2011). MSC: 68N30 03B44 03B70 68Q25 68Q60 PDFBibTeX XMLCite \textit{B. Bollig} et al., Lect. Notes Comput. Sci. 6907, 132--144 (2011; Zbl 1343.68055) Full Text: DOI
Akshay, S.; Gastin, Paul; Mukund, Madhavan; Kumar, K. Narayan Model checking time-constrained scenario-based specifications. (English) Zbl 1245.68129 Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15–18, 2010, Chennai, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPIcs – Leibniz International Proceedings in Informatics 8, 204-215, electronic only (2010). MSC: 68Q60 PDFBibTeX XMLCite \textit{S. Akshay} et al., LIPIcs -- Leibniz Int. Proc. Inform. 8, 204--215 (2010; Zbl 1245.68129) Full Text: DOI Link
Gastin, Paul; Sznajder, Nathalie; Zeitoun, Marc Distributed synthesis for well-connected architectures. (English) Zbl 1180.68056 Form. Methods Syst. Des. 34, No. 3, 215-237 (2009). MSC: 68M14 68Q60 PDFBibTeX XMLCite \textit{P. Gastin} et al., Form. Methods Syst. Des. 34, No. 3, 215--237 (2009; Zbl 1180.68056) Full Text: DOI
Chatain, Thomas; Gastin, Paul; Sznajder, Nathalie Natural specifications yield decidability for distributed synthesis of asynchronous systems. (English) Zbl 1206.68210 Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24–30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 141-152 (2009). MSC: 68Q85 68Q60 PDFBibTeX XMLCite \textit{T. Chatain} et al., Lect. Notes Comput. Sci. 5404, 141--152 (2009; Zbl 1206.68210) Full Text: DOI
Bhateja, Puneet; Gastin, Paul; Mukund, Madhavan A fresh look at testing for asynchronous communication. (English) Zbl 1161.68349 Graf, Susanne (ed.) et al., Automated technology for verification and analysis. 4th international symposium, ATVA 2006, Beijing, China, October 23–26, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-47237-7/pbk). Lecture Notes in Computer Science 4218, 369-383 (2006). MSC: 68M15 68Q60 PDFBibTeX XMLCite \textit{P. Bhateja} et al., Lect. Notes Comput. Sci. 4218, 369--383 (2006; Zbl 1161.68349) Full Text: DOI
Gastin, Paul; Sznajder, Nathalie; Zeitoun, Marc Distributed synthesis for well-connected architectures. (English) Zbl 1177.68146 Arun-Kumar, S. (ed.) et al., FSTTCS 2006: Foundations of software technology and theoretical computer science. 26th international conference, Kolkata, India, December 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49994-7/pbk). Lecture Notes in Computer Science 4337, 321-332 (2006). MSC: 68Q60 68Q85 PDFBibTeX XMLCite \textit{P. Gastin} et al., Lect. Notes Comput. Sci. 4337, 321--332 (2006; Zbl 1177.68146) Full Text: DOI HAL
Diekert, Volker; Gastin, Paul Pure future local temporal logics are expressively complete for Mazurkiewicz traces. (English) Zbl 1196.68155 Farach-Colton, Martin (ed.), LATIN 2004: Theoretical informatics. 6th Latin American symposium, Buenos Aires, Argentina, April 5–8, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21258-2/pbk). Lecture Notes in Computer Science 2976, 232-241 (2004). MSC: 68Q85 03B44 68Q60 PDFBibTeX XMLCite \textit{V. Diekert} and \textit{P. Gastin}, Lect. Notes Comput. Sci. 2976, 232--241 (2004; Zbl 1196.68155) Full Text: DOI
Gastin, Paul; Moro, Pierre; Zeitoun, Marc Minimization of counterexamples in SPIN. (English) Zbl 1125.68369 Graf, Susanne (ed.) et al., Model checking software. 11th international SPIN workshop, Barcelona, Spain, April 1–3, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21314-7/pbk). Lecture Notes in Computer Science 2989, 92-108 (2004). MSC: 68N99 68Q60 PDFBibTeX XMLCite \textit{P. Gastin} et al., Lect. Notes Comput. Sci. 2989, 92--108 (2004; Zbl 1125.68369) Full Text: DOI
Gastin, Paul; Kuske, Dietrich Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. (English) Zbl 1195.68068 Amadio, Roberto (ed.) et al., CONCUR 2003 – concurrency theory. 14th international conference, Marseille, France, September 3–5, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40753-7/pbk). Lect. Notes Comput. Sci. 2761, 222-236 (2003). MSC: 68Q85 03B44 68Q25 68Q60 PDFBibTeX XMLCite \textit{P. Gastin} and \textit{D. Kuske}, Lect. Notes Comput. Sci. 2761, 222--236 (2003; Zbl 1195.68068) Full Text: DOI
Gastin, Paul; Oddoux, Denis LTL with past and two-way very-weak alternating automata. (English) Zbl 1124.68387 Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2003. 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25–29, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40671-9/pbk). Lect. Notes Comput. Sci. 2747, 439-448 (2003). MSC: 68Q60 03B44 03D05 68Q45 PDFBibTeX XMLCite \textit{P. Gastin} and \textit{D. Oddoux}, Lect. Notes Comput. Sci. 2747, 439--448 (2003; Zbl 1124.68387) Full Text: DOI
Gastin, Paul; Mukund, Madhavan; Kumar, K. Narayan Local LTL with past constants is expressively complete for Mazurkiewicz traces. (English) Zbl 1124.68391 Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2003. 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25–29, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40671-9/pbk). Lect. Notes Comput. Sci. 2747, 429-438 (2003). MSC: 68Q85 03B44 68Q60 PDFBibTeX XMLCite \textit{P. Gastin} et al., Lect. Notes Comput. Sci. 2747, 429--438 (2003; Zbl 1124.68391) Full Text: DOI
Gastin, Paul; Mukund, Madhavan An elementary expressively complete temporal logic for Mazurkiewicz traces. (English) Zbl 1057.68058 Widmayer, Peter (ed.) et al., Automata, languages and programming. 29th international colloquium, ICALP 2002, Málaga, Spain, July 8–13, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43864-5). Lect. Notes Comput. Sci. 2380, 938-949 (2002). MSC: 68Q60 68Q85 03B44 PDFBibTeX XMLCite \textit{P. Gastin} and \textit{M. Mukund}, Lect. Notes Comput. Sci. 2380, 938--949 (2002; Zbl 1057.68058) Full Text: Link
Diekert, Volker; Gastin, Paul LTL is expressively complete for Mazurkiewicz traces. (English) Zbl 1013.68130 J. Comput. Syst. Sci. 64, No. 2, 396-418 (2002). MSC: 68Q85 03B44 68Q60 PDFBibTeX XMLCite \textit{V. Diekert} and \textit{P. Gastin}, J. Comput. Syst. Sci. 64, No. 2, 396--418 (2002; Zbl 1013.68130) Full Text: DOI
Diekert, Volker; Gastin, Paul Local temporal logic is expressively complete for cograph dependence alphabets. (English) Zbl 1275.68089 Nieuwenhuis, Robert (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 8th international conference, LPAR 2001, Havana, Cuba, December 3–7, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42957-3/pbk). Lecture Notes in Computer Science 2250. Lecture Notes in Artificial Intelligence, 55-69 (2001). MSC: 68Q60 03B44 68Q85 PDFBibTeX XMLCite \textit{V. Diekert} and \textit{P. Gastin}, Lect. Notes Comput. Sci. 2250, 55--69 (2001; Zbl 1275.68089) Full Text: DOI
Gastin, Paul; Oddoux, Denis Fast LTL to Büchi automata translation. (English) Zbl 0991.68044 Berry, Gérard (ed.) et al., Computer aided verification. 13th international conference, CAV 2001, Paris, France, July 18-22, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2102, 53-65 (2001). MSC: 68Q60 68Q45 PDFBibTeX XMLCite \textit{P. Gastin} and \textit{D. Oddoux}, Lect. Notes Comput. Sci. 2102, 53--65 (2001; Zbl 0991.68044) Full Text: Link
Derepas, Fabrice; Gastin, Paul Model checking systems of replicated processes with Spin. (English) Zbl 0985.68521 Dwyer, Matthew (ed.), Model checking software. 8th international SPIN workshop, Toronto, Canada, May 19-20, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2057, 235-251 (2001). MSC: 68Q60 68M14 PDFBibTeX XMLCite \textit{F. Derepas} and \textit{P. Gastin}, Lect. Notes Comput. Sci. 2057, 235--251 (2001; Zbl 0985.68521) Full Text: Link
Diekert, Volker; Gastin, Paul LTL is expressively complete for Mazurkiewicz traces. (English) Zbl 0973.68165 Montanari, Ugo (ed.) et al., Automata, languages and programming. 27th international colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1853, 211-222 (2000). MSC: 68Q85 68Q60 03B44 03B70 PDFBibTeX XMLCite \textit{V. Diekert} and \textit{P. Gastin}, Lect. Notes Comput. Sci. 1853, 211--222 (2000; Zbl 0973.68165)
Diekert, Volker; Gastin, Paul An expressively complete temporal logic without past tense operators for Mazurkiewicz traces. (English) Zbl 0942.03028 Flum, Jörg (ed.) et al., Computer science logic. 13th international workshop, CSL ’99. 8th annual conference of the EACSL, Madrid, Spain, September 20-25, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1683, 188-203 (1999). MSC: 03B44 68Q85 68Q60 PDFBibTeX XMLCite \textit{V. Diekert} and \textit{P. Gastin}, Lect. Notes Comput. Sci. 1683, 188--203 (1999; Zbl 0942.03028)