×

Found 32 Documents (Results 1–32)

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
Full Text: DOI HAL

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI Link

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
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI HAL

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI

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
Full Text: Link

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
Full Text: DOI

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

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

all top 3

Software