×

Found 55 Documents (Results 1–55)

Reaching your goal optimally by playing at random with no memory. (English) Zbl 07559482

Konnov, Igor (ed.) et al., 31st international conference on concurrency theory. CONCUR 2020, September 1–4, 2020, Vienna, Austria, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 171, Article 26, 21 p. (2020).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

On computability of data word functions defined by transducers. (English) Zbl 07250940

Goubault-Larrecq, Jean (ed.) et al., Foundations of software science and computation structures. 23rd international conference, FOSSACS 2020, held as part of the European joint conferences on theory and practice of software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12077, 217-236 (2020).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Synthesis of data word transducers. (English) Zbl 07649932

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 24, 15 p. (2019).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI

Sequentiality of string-to-context transducers. (English) Zbl 07561621

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 128, 14 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the computation of the minimal coverability set of Petri nets. (English) Zbl 07121144

Filiot, Emmanuel (ed.) et al., Reachability problems. 13th international conference, RP 2019, Brussels, Belgium, September 11–13, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11674, 164-177 (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI HAL

Mathematical informatics. A photography in 2019. (Informatique mathématique. Une photographie en 2019.) (French) Zbl 1440.68006

CNRS Alpha. Paris: CNRS Éditions (ISBN 978-2-271-12611-5/pbk). 148 p. (2019).
PDFBibTeX XMLCite

Symbolic approximation of weighted timed games. (English) Zbl 1528.68178

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 28, 16 p. (2018).
MSC:  68Q45 91A50 91A80
PDFBibTeX XMLCite
Full Text: DOI arXiv

Optimal and robust controller synthesis. Using energy timed automata with uncertainty. (English) Zbl 1460.93031

Havelund, Klaus (ed.) et al., Formal methods. 22nd international symposium, FM 2018, held as part of the federated logic conference, FloC 2018, Oxford, UK, July 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10951, 203-221 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Reachability problems. 12th international conference, RP 2018, Marseille, France, September 24–26, 2018. Proceedings. (English) Zbl 1396.68021

Lecture Notes in Computer Science 11123. Cham: Springer (ISBN 978-3-030-00249-7/pbk; 978-3-030-00250-3/ebook). xxi, 161 p. (2018).
MSC:  68-06 68Qxx 00B25
PDFBibTeX XMLCite
Full Text: DOI

Degree of sequentiality of weighted automata. (English) Zbl 1396.68075

Esparza, Javier (ed.) et al., Foundations of software science and computation structures. 20th international conference, FOSSACS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Berlin: Springer (ISBN 978-3-662-54457-0/pbk; 978-3-662-54458-7/ebook). Lecture Notes in Computer Science 10203, 215-230 (2017).
MSC:  68Q70 68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Optimal reachability in divergent weighted timed games. (English) Zbl 1486.68092

Esparza, Javier (ed.) et al., Foundations of software science and computation structures. 20th international conference, FOSSACS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10203, 162-178 (2017).
MSC:  68Q45 91A05 91A80
PDFBibTeX XMLCite
Full Text: DOI arXiv

A generalised twinning property for minimisation of cost register automata. (English) Zbl 1401.68160

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 857-866 (2016).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI Link

Two-way visibly pushdown automata and transducers. (English) Zbl 1394.68209

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 217-226 (2016).
MSC:  68Q45 03D05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Decision problems of tree transducers with origin. (English) Zbl 1395.68167

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-47665-9/pbk; 978-3-662-47666-6/ebook). Lecture Notes in Computer Science 9135, 209-221 (2015).
MSC:  68Q45 03D05
PDFBibTeX XMLCite
Full Text: DOI Link

Visibly pushdown transducers with well-nested outputs. (English) Zbl 1425.68228

Shur, Arseny M. (ed.) et al., Developments in language theory. 18th international conference, DLT 2014, Ekaterinburg, Russia, August 26–29, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8633, 129-141 (2014).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI HAL

Expressiveness of visibly pushdown transducers. (English) Zbl 1464.68158

Maneth, Sebastian (ed.), Proceedings of the 2nd international workshop on trends in tree automata and tree transducers, TTATT’13, Hanoi, Vietnam, October 19, 2013. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 134, 17-26 (2013).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: arXiv Link

From two-way to one-way finite state transducers. (English) Zbl 1366.68143

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). 468-477 (2013).
MSC:  68Q45 03B25 03D05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Robust controller synthesis in timed automata. (English) Zbl 1390.68416

D’Argenio, Pedro R. (ed.) et al., CONCUR 2013 – concurrency theory. 24th international conference, CONCUR 2013, Buenos Aires, Argentina, August 27–30, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40183-1/pbk). Lecture Notes in Computer Science 8052, 546-560 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Trimming visibly pushdown automata. (English) Zbl 1298.68125

Konstantinidis, Stavros (ed.), Implementation and application of automata. 18th international conference, CIAA 2013, Halifax, NS, Canada, July 16–19, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-39273-3/pbk). Lecture Notes in Computer Science 7982, 84-96 (2013).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Robustness of time Petri nets under guard enlargement. (English) Zbl 1355.68187

Finkel, Alain (ed.) et al., Reachability problems. 6th international workshop, RP 2012, Bordeaux, France, September 17–19, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33511-2/pbk). Lecture Notes in Computer Science 7550, 92-106 (2012).
MSC:  68Q85 68Q45
PDFBibTeX XMLCite
Full Text: DOI HAL

Controllers with minimal observation power (application to timed systems). (English) Zbl 1374.68255

Chakraborty, Supratik (ed.) et al., Automated technology for verification and analysis. 10th international symposium, ATVA 2012, Thiruvananthapuram, India, October 3–6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33385-9/pbk). Lecture Notes in Computer Science 7561, 223-237 (2012).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Visibly pushdown automata with multiplicities: finiteness and \(K\)-boundedness. (English) Zbl 1370.68162

Yen, Hsu-Chun (ed.) et al., Developments in language theory. 16th international conference, DLT 2012, Taipei, Taiwan, August 14–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31652-4/pbk). Lecture Notes in Computer Science 7410, 226-238 (2012).
MSC:  68Q45 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Streamability of nested word transductions. (English) Zbl 1246.68143

Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12–14, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPIcs – Leibniz International Proceedings in Informatics 13, 312-324, electronic only (2011).
MSC:  68Q45 68P05
PDFBibTeX XMLCite
Full Text: DOI

A hierarchical approach for the synthesis of stabilizing controllers for hybrid systems. (English) Zbl 1348.93157

Bultan, Tevfik (ed.) et al., Automated technology for verification and analysis. 9th international symposium, ATVA 2011, Taipei, Taiwan, October 11–14, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24371-4/pbk). Lecture Notes in Computer Science 6996, 198-212 (2011).
MSC:  93C30 68Q60 93B50
PDFBibTeX XMLCite
Full Text: DOI

Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning. (English) Zbl 1330.68216

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, 69-88 (2011).
MSC:  68Q85 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Quantitative robustness analysis of flat timed automata. (English) Zbl 1326.68185

Hofmann, Martin (ed.), Foundations of software science and computational structures. 14th international conference, FOSSACS 2011, held as part of the joint European conferences on theory and practice of software, ETAPS 2011, Saarbrücken, Germany, March 26 – April 3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19804-5/pbk). Lecture Notes in Computer Science 6604, 229-244 (2011).
MSC:  68Q60 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Properties of visibly pushdown transducers. (English) Zbl 1287.68095

Hliněný, Petr (ed.) et al., Mathematical foundations of computer science 2010. 35th international symposium, MFCS 2010, Brno, Czech Republic, August 23–27, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15154-5/pbk). Lecture Notes in Computer Science 6281, 355-367 (2010).
MSC:  68Q45 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Weak time Petri nets strike back! (English) Zbl 1254.68180

Bravetti, Mario (ed.) et al., CONCUR 2009 – concurrency theory. 20th international conference, CONCUR 2009, Bologna, Italy, September 1–4, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04080-1/pbk). Lecture Notes in Computer Science 5710, 557-571 (2009).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI

Automatic synthesis of robust and optimal controllers – an industrial case study. (English) Zbl 1237.93058

Majumdar, Rupak (ed.) et al., Hybrid systems: Computation and control. 12th international conference, HSCC 2009, San Francisco, CA, USA, April 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00601-2/pbk). Lecture Notes in Computer Science 5469, 90-104 (2009).
MSC:  93B51 93B50 93C95
PDFBibTeX XMLCite
Full Text: DOI

Robust analysis of timed automata via channel machines. (English) Zbl 1138.68431

Amadio, Roberto (ed.), Foundations of software science and computational structures. 11th international conference, FOSSACS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29–April 6, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78497-5/pbk). Lecture Notes in Computer Science 4962, 157-171 (2008).
MSC:  68Q45 68Q60
PDFBibTeX XMLCite
Full Text: DOI

Robust model-checking of linear-time properties in timed automata. (English) Zbl 1145.68464

Correa, José R. (ed.) et al., LATIN 2006: Theoretical informatics. 7th Latin American symposium, Valdivia, Chile, March 20–24, 2006. Proceedings. Berlin: Springer (ISBN 3-540-32755-X/pbk). Lecture Notes in Computer Science 3887, 238-249 (2006).
MSC:  68Q60 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Timed unfoldings for networks of timed automata. (English) Zbl 1161.68614

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, 292-306 (2006).
MSC:  68Q85 68Q60
PDFBibTeX XMLCite
Full Text: DOI Link

Timed Petri nets and timed automata: on the discriminating power of Zeno sequences. (English) Zbl 1133.68383

Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10–14, 2006. Proceedings, Part II. Berlin: Springer (ISBN 978-3-540-35907-4/pbk). Lecture Notes in Computer Science 4052, 420-431 (2006).
MSC:  68Q85 68Q45
PDFBibTeX XMLCite
Full Text: DOI Link

Diagonal constraints in timed automata: Forward analysis of timed systems. (English) Zbl 1175.68256

Pettersson, Paul (ed.) et al., Formal modeling and analysis of timed systems. Third international conference, FORMATS 2005, Uppsala, Sweden, September 26–28, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30946-2/pbk). Lecture Notes in Computer Science 3829, 112-126 (2005).
MSC:  68Q60 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software