×

Found 28 Documents (Results 1–28)

Newest Citations Relevance
Czerwiński, Wojciech; Hofman, Piotr

Language inclusion for boundedly-ambiguous vector addition systems is decidable. (English) Zbl 07896549

Klin, Bartek (ed.) et al., 33rd international conference on concurrency theory, CONCUR 2022, Warsaw, Poland, September 12–16, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 243, Article 16, 22 p. (2022).
MSC:  68Q85
PDFBibTeX XMLCite
\textit{W. Czerwiński} and \textit{P. Hofman}, LIPIcs -- Leibniz Int. Proc. Inform. 243, Article 16, 22 p. (2022; Zbl 07896549)
Full Text: DOI arXiv
Schlachter, Uli; Wimmel, Harro

\(k\)-bounded Petri net synthesis from modal transition systems. (English) Zbl 1442.68151

Meyer, Roland (ed.) et al., 28th international conference on concurrency theory. CONCUR 2017, Berlin, Germany, September 5–8, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 85, Article 6, 15 p. (2017).
MSC:  68Q85
PDFBibTeX XMLCite
\textit{U. Schlachter} and \textit{H. Wimmel}, LIPIcs -- Leibniz Int. Proc. Inform. 85, Article 6, 15 p. (2017; Zbl 1442.68151)
Full Text: DOI
Hague, M.

Senescent ground tree rewrite systems. (English) Zbl 1401.68135

Proceedings of the joint meeting of the twenty-third EACSL annual conference on computer science logic, CSL, and the 2014 29th annual ACM/IEEE symposium on logic in computer science, LICS 2014, Vienna, Austria, July 14–18, 2014. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4503-2886-9). Paper No. 48, 10 p. (2014).
MSC:  68Q42 68Q17 68Q85
PDFBibTeX XMLCite
\textit{M. Hague}, in: Proceedings of the joint meeting of the twenty-third EACSL annual conference on computer science logic, CSL, and the 2014 29th annual ACM/IEEE symposium on logic in computer science, LICS 2014, Vienna, Austria, July 14--18, 2014. Los Alamitos, CA: IEEE Computer Society. Paper No. 48, 10 p. (2014; Zbl 1401.68135)
Full Text: DOI arXiv
Leroux, Jérôme; Penelle, Vincent; Sutre, Gregoire

On the context-freeness problem for vector addition systems. (English) Zbl 1366.68210

Proceedings of the 2013 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, Tulane University, New Orleans, LA, USA, June 25–28, 2013. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-5020-6). 43-52 (2013).
MSC:  68Q85 68Q42 68Q45
PDFBibTeX XMLCite
\textit{J. Leroux} et al., in: Proceedings of the 2013 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, Tulane University, New Orleans, LA, USA, June 25--28, 2013. Los Alamitos, CA: IEEE Computer Society. 43--52 (2013; Zbl 1366.68210)
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
Praveen, M.; Lodaya, Kamal

Analyzing reachability for some Petri nets with fast growing markings. (English) Zbl 1337.68190

Halava, Vesa (ed.) et al., Proceedings of the 2nd workshop on reachability problems in computational models (RP 2008), Liverpool, UK, September 15–17, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 223, 215-237 (2008).
MSC:  68Q85 68Q17 68Q25
PDFBibTeX XMLCite
\textit{M. Praveen} and \textit{K. Lodaya}, Electron. Notes Theor. Comput. Sci. 223, 215--237 (2008; Zbl 1337.68190)
Full Text: DOI
Ogata, Shougo; Tsuchiya, Tatsuhiro; Kikuno, Tohru

SAT-based verification of safe Petri nets. (English) Zbl 1108.68082

Wang, Farn (ed.), Automated technology for verification and analysis. Second international conference, ATVA 2004, Taipei, Taiwan, ROC, October 31 – November 3, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23610-4/pbk). Lecture Notes in Computer Science 3299, 79-92 (2004).
MSC:  68Q85 68Q60
PDFBibTeX XMLCite
\textit{S. Ogata} et al., Lect. Notes Comput. Sci. 3299, 79--92 (2004; Zbl 1108.68082)
Full Text: DOI
Yoneda, Tomohiro; Zhou, Bin; Schlingloff, Bernd-Holger

Verification of bounded delay asynchronous circuits with timed traces. (English) Zbl 0929.94034

Haeberer, Armando Martín (ed.), Algebraic methodology and software technology. 7th international conference, AMAST ’98, Amazonia, Brazil, January 4–8, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1548, 59-73 (1999).
MSC:  94C10 68Q60
PDFBibTeX XMLCite
\textit{T. Yoneda} et al., Lect. Notes Comput. Sci. 1548, 59--73 (1999; Zbl 0929.94034)

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software