Leroux, Jérôme Flat Petri nets (invited talk). (English) Zbl 1489.68164 Buchs, Didier (ed.) et al., Application and theory of Petri nets and concurrency. 42nd international conference, PETRI NETS 2021, virtual event, June 23–25, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12734, 17-30 (2021). MSC: 68Q85 PDFBibTeX XMLCite \textit{J. Leroux}, Lect. Notes Comput. Sci. 12734, 17--30 (2021; Zbl 1489.68164) Full Text: DOI HAL
Finkel, Alain; Praveen, M. Verification of flat FIFO systems. (English) Zbl 07649920 Fokkink, Wan (ed.) et al., 30th international conference on concurrency theory, CONCUR 2019, Amsterdam, the Netherlands, August 27–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 140, Article 12, 17 p. (2019). MSC: 68Q85 PDFBibTeX XMLCite \textit{A. Finkel} and \textit{M. Praveen}, LIPIcs -- Leibniz Int. Proc. Inform. 140, Article 12, 17 p. (2019; Zbl 07649920) Full Text: DOI
Lengál, Ondřej; Lin, Anthony W.; Majumdar, Rupak; Rümmer, Philipp Fair termination for parameterized probabilistic concurrent systems. (English) Zbl 1452.68127 Legay, Axel (ed.) et al., Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 10205, 499-517 (2017). MSC: 68Q85 68Q60 68Q87 PDFBibTeX XMLCite \textit{O. Lengál} et al., Lect. Notes Comput. Sci. 10205, 499--517 (2017; Zbl 1452.68127) Full Text: DOI arXiv Link
Chambart, Pierre; Finkel, Alain; Schmitz, Sylvain Forward analysis and model checking for trace bounded WSTS. (English) Zbl 1343.68162 Theor. Comput. Sci. 637, 1-29 (2016). MSC: 68Q85 68Q60 PDFBibTeX XMLCite \textit{P. Chambart} et al., Theor. Comput. Sci. 637, 1--29 (2016; Zbl 1343.68162) Full Text: DOI
Chambart, Pierre; Finkel, Alain; Schmitz, Sylvain Forward analysis and model checking for trace bounded WSTS. (English) Zbl 1330.68197 Kristensen, Lars M. (ed.) et al., Applications and theory of Petri nets. 32nd international conference, PETRI NETS 2011, Newcastle, UK, June 20–24, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21833-0/pbk). Lecture Notes in Computer Science 6709, 49-68 (2011). MSC: 68Q85 68Q60 PDFBibTeX XMLCite \textit{P. Chambart} et al., Lect. Notes Comput. Sci. 6709, 49--68 (2011; Zbl 1330.68197) Full Text: DOI arXiv
Bouajjani, Ahmed; Bozga, Marius; Habermehl, Peter; Iosif, Radu; Moro, Pierre; Vojnar, Tomáš Programs with lists are counter automata. (English) Zbl 1217.68059 Form. Methods Syst. Des. 38, No. 2, 158-192 (2011). MSC: 68N30 68Q45 68Q60 68Q85 PDFBibTeX XMLCite \textit{A. Bouajjani} et al., Form. Methods Syst. Des. 38, No. 2, 158--192 (2011; Zbl 1217.68059) Full Text: DOI
Bouchy, Florent; Finkel, Alain; Sangnier, Arnaud Reachability in timed counter systems. (English) Zbl 1347.68255 Habermehl, P. (ed.) et al., Proceedings of the 8th, 9th, and 10th international workshops on verification of infinite-state systems (INFINITY 2006, 2007, 2008), Bonn, Germany, August 26, 2006, Lisbon, Portugal, September 8, 2007, Toronto, Canada, August 23, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 239, 167-178 (2009). MSC: 68Q85 68Q45 68Q60 PDFBibTeX XMLCite \textit{F. Bouchy} et al., Electron. Notes Theor. Comput. Sci. 239, 167--178 (2009; Zbl 1347.68255) Full Text: DOI
Lime, Didier; Roux, Olivier H. Formal verification of real-time systems with preemptive scheduling. (English) Zbl 1185.68429 Real-Time Syst. 41, No. 2, 118-151 (2009). MSC: 68Q65 68Q85 68Q80 PDFBibTeX XMLCite \textit{D. Lime} and \textit{O. H. Roux}, Real-Time Syst. 41, No. 2, 118--151 (2009; Zbl 1185.68429) Full Text: DOI HAL
Choppy, Christine; Mayero, Micaela; Petrucci, Laure Experimenting formal proofs of Petri nets refinements. (English) Zbl 1283.68236 Boiten, Eerke (ed.) et al., Proceedings of the 13th BCS-FACS refinement workshop (REFINE 2008), Turku, Finland, May 27, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 214, 231-254 (2008). MSC: 68Q85 68Q60 68T15 PDFBibTeX XMLCite \textit{C. Choppy} et al., Electron. Notes Theor. Comput. Sci. 214, 231--254 (2008; Zbl 1283.68236) Full Text: DOI
Geeraerts, G.; Raskin, J.-F.; Van Begin, L. Expand, enlarge and check: new algorithms for the coverability problem of WSTS. (English) Zbl 1105.68084 J. Comput. Syst. Sci. 72, No. 1, 180-203 (2006). MSC: 68Q85 68Q60 PDFBibTeX XMLCite \textit{G. Geeraerts} et al., J. Comput. Syst. Sci. 72, No. 1, 180--203 (2006; Zbl 1105.68084) Full Text: DOI
Leroux, Jérôme; Sutre, Grégoire Flat counter automata almost everywhere! (English) Zbl 1170.68519 Peled, Doron A. (ed.) et al., Automated technology for verification and analysis. Third international symposium, ATVA 2005, Taipei, Taiwan, October 4–7, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29209-8/pbk). Lecture Notes in Computer Science 3707, 489-503 (2005). MSC: 68Q60 68Q45 68Q85 PDFBibTeX XMLCite \textit{J. Leroux} and \textit{G. Sutre}, Lect. Notes Comput. Sci. 3707, 489--503 (2005; Zbl 1170.68519) Full Text: DOI