|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 48 occurrences of 43 keywords
|
|
|
Results
Found 233 publication records. Showing 233 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
147 | Sriram C. Krishnan, Anuj Puri, Robert K. Brayton |
Deterministic w Automata vis-a-vis Deterministic Buchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 378-386, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
97 | Orna Kupferman, Moshe Y. Vardi |
Weak Alternating Automata Are Not That Weak. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 147-158, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
58 | Ichiro Suzuki |
Formal Analysis of the Alternating Bit Protocol by Temporal Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(11), pp. 1273-1281, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
temporal Petri nets, omega -regular expressions, Buchi-automata, formal specification, formal specification, Petri nets, formal verification, program verification, programming theory, transitions, formal analysis, automata theory, firings, formulas, alternating bit protocol, temporal operators |
50 | Yong Li 0031, Sven Schewe, Moshe Y. Vardi |
Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.09966, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
50 | Yong Li 0031, Sven Schewe, Moshe Y. Vardi |
Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 37:1-37:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
50 | Carsten Fritz |
Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings, pp. 35-48, 2003, Springer, 3-540-40561-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
47 | Souheib Baarir, Alexandre Duret-Lutz |
Emptiness Check of Powerset Buchi Automata using Inclusion Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSD ![In: Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 10-13 July 2007, Bratislava, Slovak Republic, pp. 41-50, 2007, IEEE Computer Society, 978-0-7695-2902-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
45 | Bowen Alpern, Fred B. Schneider |
Verifying Temporal Properties without Temporal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 11(1), pp. 147-167, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
43 | Yih-Kuen Tsay, Ming-Hsien Tsai 0001, Jinn-Shu Chang, Yi-Wen Chang |
Büchi Store: An Open Repository of Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems - 17th International Conference, TACAS 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, pp. 262-266, 2011, Springer, 978-3-642-19834-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
43 | Udi Boker, Orna Kupferman |
The Quest for a Tight Translation of Büchi to co-Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fields of Logic and Computation ![In: Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, pp. 147-164, 2010, Springer, 978-3-642-15024-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
41 | Mihalis Yannakakis, Kousha Etessami |
Checking LTL Properties of Recursive Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QEST ![In: Second International Conference on the Quantitative Evaluaiton of Systems (QEST 2005), 19-22 September 2005, Torino, Italy, pp. 155-165, 2005, IEEE Computer Society, 0-7695-2427-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Christel Baier, Marcus Größer |
Recognizing omega-regular Languages with Probabilistic Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, pp. 137-146, 2005, IEEE Computer Society, 0-7695-2266-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Abdelaziz Fellah |
Time and alternation: an automata based framework to software model checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 2498-2502, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
software verification and testing, timed alternating and buchi automata, timed temporal propositional logic, software model checking |
36 | Zhe Chen 0011, Gilles Motet |
Separating Functional and Dependability Requirements of Embedded Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: 10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, West Yorkshire, UK, June 29-July 1, 2010, pp. 2373-2380, 2010, IEEE Computer Society, 978-0-7695-4108-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
buchi automata, model monitoring, model checking, reliability, dependability, safety, requirements evolution |
36 | Nils Klarlund |
Progress Measures for Complementation of omega-Automata with Applications to Temporal Logic ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 358-367, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
complementation omega -automata, languages of infinite words, Buchi automata, Streett automata, optimal complementation, temporal logic, finite-state automata, ETLs, graph-theoretic approach |
36 | Shmuel Safra |
On the Complexity of omega-Automata ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 319-327, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Buchi automata, complexity, decision procedures, deterministic automata, omega -automata |
35 | Fabio Massacci, Ida Sri Rejeki Siahaan |
Simulating midlet's security claims with automata modulo theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLAS ![In: Proceedings of the 2008 Workshop on Programming Languages and Analysis for Security, PLAS 2008, Tucson, AZ, USA, June 8, 2008, pp. 1-9, 2008, ACM, 978-1-59593-936-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
security policy, automata, mobile code |
35 | Sriram C. Krishnan, Anuj Puri, Robert K. Brayton |
Structural Complexity of Omega-Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 143-156, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
32 | Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert |
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 24(4), pp. 635-659, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
32 | Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková |
Sky Is Not the Limit - Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS (2) ![In: Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part II, pp. 118-136, 2022, Springer, 978-3-030-99526-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
32 | Simon Jantsch, David Müller 0001, Christel Baier, Joachim Klein 0001 |
From LTL to unambiguous Büchi automata via disambiguation of alternating automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 58(1-2), pp. 42-82, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
32 | Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková |
Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation (Technical Report). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.10187, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
32 | Simon Jantsch, David Müller 0001, Christel Baier, Joachim Klein 0001 |
From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.02887, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
32 | Simon Jantsch, David Müller 0001, Christel Baier, Joachim Klein 0001 |
From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FM ![In: Formal Methods - The Next 30 Years - Third World Congress, FM 2019, Porto, Portugal, October 7-11, 2019, Proceedings, pp. 262-279, 2019, Springer, 978-3-030-30941-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
32 | Simon Jantsch, Michael Norrish |
Verifying the LTL to Büchi Automata Translation via Very Weak Alternating Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: Interactive Theorem Proving - 9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings, pp. 306-323, 2018, Springer, 978-3-319-94820-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
32 | Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert |
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1701.06103, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
32 | Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert |
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS (1) ![In: 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, pp. 426-442, 2017, 978-3-662-54576-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
32 | Shohei Mochizuki, Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki |
Fast Translation from LTL to Büchi Automata via Non-transition-based Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings, pp. 364-379, 2014, Springer, 978-3-319-11736-2. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
32 | Cong Tian, Zhenhua Duan, Mengfei Yang |
Deternimization of Büchi Automata as Partitioned Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings, pp. 158-168, 2013, Springer, 978-3-642-38767-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
32 | Sven Schewe |
Minimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1007.1333, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
32 | Mohammad Izadi, Marcello M. Bonsangue |
Recasting Constraint Automata into Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2008, 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings, pp. 156-170, 2008, Springer, 978-3-540-85761-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Leonid Libkin, Cristina Sirangelo |
Reasoning about XML with Temporal Logics and Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings, pp. 97-112, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Query automata, XML, static analysis, temporal logics |
31 | A. Prasad Sistla |
Parametrized Verification of Linear Networks Using Automata as Invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 9th International Conference, CAV '97, Haifa, Israel, June 22-25, 1997, Proceedings, pp. 412-423, 1997, Springer, 3-540-63166-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
25 | Marek Jankola, Jan Strejcek |
Tighter Construction of Tight Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS (1) ![In: Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I, pp. 234-255, 2024, Springer, 978-3-031-57227-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Christophe Stammet, Ulrich Ultes-Nitsche, Andreas Fischer |
Universality of Büchi Automata: Analysis With Graph Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 11, pp. 140993-141007, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Vojtech Havlena, Ondrej Lengál, Yong Li 0031, Barbora Smahlíková, Andrea Turrini |
Modular Mix-and-Match Complementation of Büchi Automata (Technical Report). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.01890, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Vojtech Havlena, Ondrej Lengál, Yong Li 0031, Barbora Smahlíková, Andrea Turrini |
Modular Mix-and-Match Complementation of Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS (1) ![In: Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part I, pp. 249-270, 2023, Springer, 978-3-031-30822-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove |
Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pp. 6420-6425, 2023, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove |
Half-Positional Objectives Recognized by Deterministic Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.01365, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Christophe Stammet, Prisca Dotti, Ulrich Ultes-Nitsche, Andreas Fischer |
Analyzing Büchi Automata with Graph Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.09619, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Yong Li 0031, Andrea Turrini, Weizhi Feng, Moshe Y. Vardi, Lijun Zhang 0001 |
Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.13739, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková |
Complementing Büchi Automata with Ranker (Technical Report). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.01946, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Yong Li 0031, Andrea Turrini, Weizhi Feng, Moshe Y. Vardi, Lijun Zhang 0001 |
Artifact for the CAV'22 paper "Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition". ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2022 |
DOI RDF |
|
25 | Yong Li 0031, Andrea Turrini, Weizhi Feng, Moshe Y. Vardi, Lijun Zhang 0001 |
Artifact for the CAV'22 paper "Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition". ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2022 |
DOI RDF |
|
25 | Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková |
Complementing Büchi Automata with Ranker. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV (2) ![In: Computer Aided Verification - 34th International Conference, CAV 2022, Haifa, Israel, August 7-10, 2022, Proceedings, Part II, pp. 188-201, 2022, Springer, 978-3-031-13187-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Yong Li 0031, Andrea Turrini, Weizhi Feng, Moshe Y. Vardi, Lijun Zhang 0001 |
Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV (2) ![In: Computer Aided Verification - 34th International Conference, CAV 2022, Haifa, Israel, August 7-10, 2022, Proceedings, Part II, pp. 152-173, 2022, Springer, 978-3-031-13187-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | León Bohn, Christof Löding |
Passive Learning of Deterministic Büchi Automata by Combinations of DFAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 114:1-114:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove |
Half-Positional Objectives Recognized by Deterministic Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 20:1-20:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz |
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 12:1-12:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Denis Kuperberg, Laureline Pinault, Damien Pous |
Coinductive Algorithms for Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 180(4), pp. 351-373, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Henning Urbat, Daniel Hausmann 0001, Stefan Milius, Lutz Schröder |
Nominal Büchi Automata with Name Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.03213, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
25 | Reed Oei, Dun Ma, Christian Schulz 0013, Philipp Hieronymi |
Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.01727, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
25 | Mingyu Cai, Shaoping Xiao, Zhen Kan |
Reinforcement Learning Based Temporal Logic Control with Soft Constraints Using Limit-deterministic Generalized Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.10284, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
25 | Yong Li 0031, Yih-Kuen Tsay, Moshe Y. Vardi |
Congruence Relations for Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.03555, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
25 | Wim H. Hesselink |
UNITY and Büchi automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 33(2), pp. 185-205, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Yong Li 0031, Yu-Fang Chen 0001, Lijun Zhang 0001, Depeng Liu |
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 281, pp. 104678, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Yong Li 0031, Yih-Kuen Tsay, Andrea Turrini, Moshe Y. Vardi, Lijun Zhang 0001 |
Congruence Relations for Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FM ![In: Formal Methods - 24th International Symposium, FM 2021, Virtual Event, November 20-26, 2021, Proceedings, pp. 465-482, 2021, Springer, 978-3-030-90869-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Yih-Kuen Tsay, Moshe Y. Vardi |
From Linear Temporal Logics to Büchi Automata: The Early and Simple Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Model Checking, Synthesis, and Learning ![In: Model Checking, Synthesis, and Learning - Essays Dedicated to Bengt Jonsson on The Occasion of His 60th Birthday, pp. 8-40, 2021, Springer, 978-3-030-91383-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Vojtech Havlena, Ondrej Lengál |
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 2:1-2:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Henning Urbat, Daniel Hausmann 0001, Stefan Milius, Lutz Schröder |
Nominal Büchi Automata with Name Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 4:1-4:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato |
Inclusion Testing of Büchi Automata Based on Well-Quasiorders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 3:1-3:22, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Anton Pirogov |
Determinization and ambiguity of classical and probabilistic Büchi automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2021 |
RDF |
|
25 | Ryohei Oura, Ami Sakakibara, Toshimitsu Ushio |
Reinforcement Learning of Control Policy for Linear Temporal Logic Specifications Using Limit-Deterministic Generalized Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Control. Syst. Lett. ![In: IEEE Control. Syst. Lett. 4(3), pp. 761-766, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Amar Isli |
Buchi automata augmented with spatial constraints: simulating an alternating with a nondeterministic and deciding the emptiness problem for the latter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.11510, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Simon Wimmer 0001, Frédéric Herbreteau, Jaco van de Pol |
Certifying Emptiness of Timed Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.04150, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Ryohei Oura, Ami Sakakibara, Toshimitsu Ushio |
Reinforcement Learning of Control Policy for Linear Temporal Logic Specifications Using Limit-Deterministic Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.04669, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Yong Li 0031, Andrea Turrini, Xuechao Sun, Lijun Zhang 0001 |
Proving Non-Inclusion of Büchi Automata based on Monte Carlo Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.02282, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Vojtech Havlena, Ondrej Lengál |
Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.07834, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Christof Löding, Anton Pirogov |
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.13692, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Eleni Mandrali |
A translation of weighted LTL formulas to weighted Büchi automata over ω-valuation monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.05027, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Frantisek Blahoudek, Alexandre Duret-Lutz, Jan Strejcek |
Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV (2) ![In: Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part II, pp. 15-27, 2020, Springer, 978-3-030-53290-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Torsten Liebke |
Büchi-Automata guided Partial Order Reduction for LTL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PNSE@Petri Nets ![In: Proceedings of the International Workshop on Petri Nets and Software Engineering co-located with 41st International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2020), Paris, France, June 24, 2020 (due to COVID-19: virtual conference)., pp. 147-166, 2020, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Yong Li 0031, Andrea Turrini, Xuechao Sun, Lijun Zhang 0001 |
Proving Non-inclusion of Büchi Automata Based on Monte Carlo Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19-23, 2020, Proceedings, pp. 467-483, 2020, Springer, 978-3-030-59151-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Christof Löding, Anton Pirogov |
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: 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, pp. 522-541, 2020, Springer, 978-3-030-45230-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Julian Brunner 0001 |
Formal Verification of Executable Complementation and Equivalence Checking for Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFM ![In: Integrated Formal Methods - 16th International Conference, IFM 2020, Lugano, Switzerland, November 16-20, 2020, Proceedings, pp. 239-256, 2020, Springer, 978-3-030-63460-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Dana Angluin, Timos Antonopoulos, Dana Fisman |
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain., pp. 8:1-8:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-132-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Simon Wimmer 0001, Frédéric Herbreteau, Jaco van de Pol |
Certifying Emptiness of Timed Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems - 18th International Conference, FORMATS 2020, Vienna, Austria, September 1-3, 2020, Proceedings, pp. 58-75, 2020, Springer, 978-3-030-57627-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Nabil Messaoudi, Allaoua Chaoui, Mohamed Bettaz |
A technique to validate automatic generation of Büchi automata from UML 2 sequence diagrams based on multi layer transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. Robotics ![In: Int. J. Comput. Vis. Robotics 9(2), pp. 172-191, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Yu-Fang Chen 0001, Vojtech Havlena, Ondrej Lengál |
Simulations in Rank-Based Büchi Automata Complementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.07139, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Christof Löding, Anton Pirogov |
New Optimizations and Heuristics for Determinization of Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.01759, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Jaime Ramos |
Büchi automata for distributed temporal logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.01741, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Christof Löding, Anton Pirogov |
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.02139, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur |
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV (1) ![In: Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I, pp. 572-590, 2019, Springer, 978-3-030-25539-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Christof Löding, Anton Pirogov |
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece., pp. 120:1-120:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-109-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Christof Löding, Anton Pirogov |
New Optimizations and Heuristics for Determinization of Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings, pp. 317-333, 2019, Springer, 978-3-030-31783-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Yu-Fang Chen 0001, Vojtech Havlena, Ondrej Lengál |
Simulations in Rank-Based Büchi Automata Complementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems - 17th Asian Symposium, APLAS 2019, Nusa Dua, Bali, Indonesia, December 1-4, 2019, Proceedings, pp. 447-467, 2019, Springer, 978-3-030-34174-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Denis Kuperberg, Laureline Pinault, Damien Pous |
Coinductive Algorithms for Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DLT ![In: Developments in Language Theory - 23rd International Conference, DLT 2019, Warsaw, Poland, August 5-9, 2019, Proceedings, pp. 206-220, 2019, Springer, 978-3-030-24885-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Milka Hutagalung |
Buffered Simulation for Büchi Automata. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2019 |
RDF |
|
25 | Joachim Klein 0001, Christel Baier, Philipp Chrszon, Marcus Daum, Clemens Dubslaff, Sascha Klüppelholz, Steffen Märcker, David Müller 0001 |
Advances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic Büchi automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 20(2), pp. 179-194, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Moritz Lichter, Gert Smolka |
Constructive Analysis of S1S and Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.04967, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
25 | Qisheng Wang, Mingsheng Ying |
Quantum Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.08982, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
25 | Christof Löding, Anton Pirogov |
On finitely ambiguous Büchi automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1809.09415, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
25 | Joël D. Allred, Ulrich Ultes-Nitsche |
A Simple and Optimal Complementation Algorithm for Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, pp. 46-55, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Alexander Rabinovich |
Complementation of Finitely Ambiguous Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DLT ![In: Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings, pp. 541-552, 2018, Springer, 978-3-319-98653-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Christof Löding, Anton Pirogov |
On Finitely Ambiguous Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DLT ![In: Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings, pp. 503-515, 2018, Springer, 978-3-319-98653-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Yong Li 0031, Andrea Turrini, Yu-Fang Chen 0001, Lijun Zhang 0001 |
Learning Büchi Automata and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETSS ![In: Engineering Trustworthy Software Systems - 4th International School, SETSS 2018, Chongqing, China, April 7-12, 2018, Tutorial Lectures, pp. 38-98, 2018, Springer, 978-3-030-17600-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Yong Li 0031, Andrea Turrini, Lijun Zhang 0001, Sven Schewe |
Learning to Complement Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation - 19th International Conference, VMCAI 2018, Los Angeles, CA, USA, January 7-9, 2018, Proceedings, pp. 313-335, 2018, Springer, 978-3-319-73720-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Weiwei Li, Shuanglong Kan, Zhiqiu Huang |
A Better Translation From LTL to Transition-Based Generalized Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 5, pp. 27081-27090, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Xiujuan Wei, Yongming Li 0001 |
Fuzzy alternating Büchi automata over distributive lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Approx. Reason. ![In: Int. J. Approx. Reason. 90, pp. 144-162, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Etienne Renault, Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud |
Variations on parallel explicit emptiness checks for generalized Büchi automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 19(6), pp. 653-673, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 233 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ >>] |
|