-
1دورية أكاديمية
المؤلفون: Göller, StefanAff1, IDs00224023101213_cor1, Hilaire, Mathieu
المصدر: Theory of Computing Systems. 68(4):900-985
-
2مؤتمر
المؤلفون: Bresolin, Davide, Montanari, Angelo, Sala, Pietro
المصدر: 2008 15th International Symposium on Temporal Representation and Reasoning Temporal Representation and Reasoning, 2008. TIME '08. 15th International Symposium on. :110-117 Jun, 2008
Relation: 2008 15th International Symposium on Temporal Representation and Reasoning (TIME)
-
3
المؤلفون: Gisela Krommes, Peter Hertling
المصدر: ACM Transactions on Computational Logic. 22:1-71
مصطلحات موضوعية: Discrete mathematics, Computational Mathematics, General Computer Science, Logic, Computer science, Product (mathematics), Completeness (order theory), EXPSPACE, Boolean satisfiability problem, Satisfiability, Theoretical Computer Science
-
4
المؤلفون: Uraz Cengiz Türker, Robert M. Hierons, Khaled El-Fakih
المصدر: IEEE Transactions on Software Engineering. 47:1029-1040
مصطلحات موضوعية: Input/output, Discrete mathematics, Sequence, Finite-state machine, Computer science, EXPSPACE, Parallel algorithm, 020207 software engineering, Observable, 02 engineering and technology, State (functional analysis), Bounded function, 0202 electrical engineering, electronic engineering, information engineering, Software
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::53b0274a90dbbe052c70b064c38dbfbe
https://doi.org/10.1109/tse.2019.2911076
-
5
المؤلفون: Vladimir Zakharov, Anton Gnatenko
المصدر: Modelirovanie i Analiz Informacionnyh Sistem, Vol 27, Iss 4, Pp 428-441 (2020)
مصطلحات موضوعية: Model checking, Theoretical computer science, Computer science, EXPSPACE, Parameterized complexity, reactive system, 02 engineering and technology, Information technology, regular language, Regular language, temporal logic, 0202 electrical engineering, electronic engineering, information engineering, Temporal logic, finite state transducer, Interpretation (logic), 020207 software engineering, T58.5-58.64, Satisfiability, model checking, Decidability, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, specification, Control and Systems Engineering, Signal Processing, 020201 artificial intelligence & image processing, Software
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11ff1e922be5fbd2446b1c6a69adf75f
https://www.mais-journal.ru/jour/article/view/1434 -
6
المؤلفون: Ji Wang, Fu Song, Wan-Wei Liu, Tang-Hao-Ran Zhang
المصدر: Journal of Computer Science and Technology. 35:1365-1381
مصطلحات موضوعية: Model checking, Artificial neural network, Computer science, business.industry, Semantics (computer science), EXPSPACE, 020207 software engineering, 02 engineering and technology, Semantics, Computer Science Applications, Theoretical Computer Science, Decidability, Computational Theory and Mathematics, Fragment (logic), Hardware and Architecture, Reachability, Theory of computation, 0202 electrical engineering, electronic engineering, information engineering, Temporal logic, Artificial intelligence, business, Software
-
7
المؤلفون: Serge Haddad, Béatrice Bérard
المساهمون: Modélisation et Vérification (MoVe), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Modeling and Exploitation of Interaction and Concurrency (MEXICO), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)
المصدر: Information Processing Letters
Information Processing Letters, Elsevier, 2022, 174, pp.106208. ⟨10.1016/j.ipl.2021.106208⟩
Information Processing Letters, 2022, 174, pp.106208. ⟨10.1016/j.ipl.2021.106208⟩مصطلحات موضوعية: Discrete mathematics, Polynomial, Computer science, Reachability problem, 2-EXPTIME, 020208 electrical & electronic engineering, EXPSPACE, 020207 software engineering, 02 engineering and technology, Complexity, Computer Science Applications, Theoretical Computer Science, Cylindrical algebraic decomposition, Interrupt timed automata, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Reachability, Computer Science::Logic in Computer Science, Signal Processing, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Interrupt, Reachability problems, Computer Science::Formal Languages and Automata Theory, Information Systems, PSPACE
-
8
المؤلفون: Xiang Lian, Ye Yuan, Yuliang Ma, Yishu Wang, Guoren Wang
المصدر: Proceedings of the VLDB Endowment. 12:1058-1070
مصطلحات موضوعية: Theoretical computer science, Computer science, Shortest path problem, EXPSPACE, Scalability, General Engineering, Parallel algorithm, Graph
-
9
المؤلفون: Amit Sinhababu, Nitin Saxena, Zeyu Guo
المصدر: Theory of Computing. 15:1-30
مصطلحات موضوعية: Discrete mathematics, symbols.namesake, Finite field, Computational Theory and Mathematics, Computer science, EXPSPACE, Jacobian matrix and determinant, symbols, Field (mathematics), Algebraic number, Satisfiability, Theoretical Computer Science, PSPACE
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::1e0f66053f0cf8e791025d029b4b3b7b
https://doi.org/10.4086/toc.2019.v015a016 -
10
المؤلفون: Pietro Sala, Angelo Montanari, Adriano Peron, Laura Bozzelli
المساهمون: Bozzelli, L., Montanari, A., Sala, P., Peron, A.
مصطلحات موضوعية: Discrete mathematics, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Model checking, Interval temporal logic, EXPSPACE, Satisfiability, Complexity, Undecidable problem, Decidability, Homogeneity Assumption, Logic in Computer Science (cs.LO), Prefix, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Interval Temporal Logic, Interval (graph theory), Temporal logic, Interval Temporal Logic, Complexity, Homogeneity Assumption, Boolean satisfiability problem, Mathematics
وصف الملف: ELETTRONICO
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ae83d779af4fcbda1149a17841c0982
Find this article in full text from Springer Verlag. 
Full Text Finder