Výsledky vyhledávání - "Models of Computation—automata"
-
1
Autoři:
Zdroj: Theoretical computer science 429 (2012): 21–29. doi:10.1016/j.tcs.2011.12.020
info:cnr-pdr/source/autori:Ter Beek M. H.; Kleijn J./titolo:Vector Team Automata/doi:10.1016%2Fj.tcs.2011.12.020/rivista:Theoretical computer science/anno:2012/pagina_da:21/pagina_a:29/intervallo_pagine:21–29/volume:429Témata: Team automata, Models of Computation - Automata, General Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Petri nets, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science
Popis souboru: application/pdf
Přístupová URL adresa: http://fmt.isti.cnr.it/~mtbeek/TCS12.pdf
https://fmt.isti.cnr.it/~mtbeek/TCS12.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs429.html#BeekK12
https://www.sciencedirect.com/science/article/pii/S0304397511009868
http://www.sciencedirect.com/science/article/pii/S0304397511009868
https://core.ac.uk/display/82571580
http://www.sciencedirect.com/science/article/pii/S0304397511009868
https://doi.org/10.1016/j.tcs.2011.12.020
https://hdl.handle.net/20.500.14243/257462
https://www.openaccessrepository.it/record/163116 -
2
Autoři: a další
Přispěvatelé: a další
Zdroj: Lecture Notes in Computer Science ISBN: 9783319471655
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
7th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, pp. 784–805, Corfu, Greece, 10-14 October 2016
info:cnr-pdr/source/autori:Ter Beek M. H.; Carmona J.; Kleijn J./congresso_nome:7th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation/congresso_luogo:Corfu, Greece/congresso_data:10-14 October 2016/anno:2016/pagina_da:784/pagina_a:805/intervallo_pagine:784–805Témata: Màquines, Teoria de, Communication behaviour, Reactive components, Construction engineering, H.3.4 INFORMATION STORAGE AND RETRIEVAL. Systems and Software. Distributed systems, F.1.2 COMPUTATION BY ABSTRACT DEVICES. Modes of Computation. Parallelism and concurrency, 0102 computer and information sciences, 02 engineering and technology, Compatibility, 01 natural sciences, Machine theory, Team automata, Systems-of-systems, Correct communications, 0202 electrical engineering, electronic engineering, information engineering, F.1.1 COMPUTATION BY ABSTRACT DEVICES. Models of Computation. Automata, Multi-component systems, Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica, Automata theory, Multicomponent systems, E.4 CODING AND INFORMATION THEORY. Formal models of communication, Master-slave synchronisations, Informàtica::Informàtica teòrica [Àrees temàtiques de la UPC], Correctby, Program verification, Synchronisation policy, Correct-by-construction
Popis souboru: application/pdf
Přístupová URL adresa: https://upcommons.upc.edu/bitstream/2117/100199/3/ISoLA2016_086_final_v1-1.pdf
http://hdl.handle.net/2117/100199
https://rd.springer.com/chapter/10.1007/978-3-319-47166-2_55
https://upcommons.upc.edu/bitstream/2117/100199/3/ISoLA2016_086_final_v1-1.pdf
https://link.springer.com/chapter/10.1007%2F978-3-319-47166-2_55
https://dblp.uni-trier.de/db/conf/isola/isola2016-1.html#BeekCK16
https://upcommons.upc.edu/handle/2117/100199 -
3
Autoři:
Zdroj: Brazilian Symposium on Formal Methods (SBMF'06), pp. 41–55, Natal, Rio Grande do Norte, Brazil, 17-23 Settembre 2006
info:cnr-pdr/source/autori:Ter Beek M. H.; Gadducci F.; Janssens D./congresso_nome:Brazilian Symposium on Formal Methods (SBMF'06)/congresso_luogo:Natal, Rio Grande do Norte, Brazil/congresso_data:17-23 Settembre 2006/anno:2008/pagina_da:41/pagina_a:55/intervallo_pagine:41–55
Brazilian Symposium on Formal Methods (SBMF'06), Natal, Rio Grande do Norte, Br, 17-23/09/2017
info:cnr-pdr/source/autori:Ter Beek M., Gadducci F., Janssens D./congresso_nome:Brazilian Symposium on Formal Methods (SBMF'06)/congresso_luogo:Natal, Rio Grande do Norte, Br/congresso_data:17-23%2F09%2F2017/anno:2006/pagina_da:/pagina_a:/intervallo_pagine
ISTI Technical reports, 2005
Brazilian Symposium on Formal Methods, 59-72, Universitate Federal do Rio Grande do Sul, Natal, Brazil, September 17-23, 2006
Electronic notes in theoretical computer scienceTémata: Computer. Automation, process calculi, Semantics of Programming Languages. Algebraic approaches to semantics, Semantics of Programming Languages. Process models, F.1.1 Models of Computation. Automata, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Process calculi, Team automata, Theoretical Computer Science, F.3.2 Models of Computation. Relations between models, 0202 electrical engineering, electronic engineering, information engineering, Compositional specification, Process calculus, Computer Science(all)
Popis souboru: application/pdf; pdf
Přístupová URL adresa: https://publications.cnr.it/doc/120355
http://fmt.isti.cnr.it/~mtbeek/terBeekGadducciJanssens.pdf
http://www.cnr.it/prodotto/i/120355
https://publications.cnr.it/doc/160216
http://www.cnr.it/prodotto/i/160216
https://www.sciencedirect.com/science/article/abs/pii/S157106610800011X
https://core.ac.uk/display/54913895
http://fmt.isti.cnr.it/~mtbeek/SBMF08.pdf
https://repository.uantwerpen.be/docman/irua/4ee01a/7a249c44.pdf
https://dblp.uni-trier.de/db/journals/entcs/entcs195.html#BeekGJ08
https://arpi.unipi.it/handle/11568/125939
https://hdl.handle.net/20.500.14243/102149
http://fmt.isti.cnr.it/~mtbeek/terBeekGadducciJanssens.pdf
https://hdl.handle.net/20.500.14243/58471
https://doi.org/10.1016/j.entcs.2007.08.022
https://hdl.handle.net/10067/646170151162165141
https://repository.uantwerpen.be/docman/irua/4ee01a/7a249c44.pdf
https://hdl.handle.net/10067/1009270151162165141 -
4
Autoři:
Zdroj: 5 Workshop on Security Issues in Coordination Models, Languages, and Systems-SecCo 2004, pp. 105, London, 30 August 2004
info:cnr-pdr/source/autori:Ter Beek M.H.; Lenzini G.; Petrocchi M./congresso_nome:5 Workshop on Security Issues in Coordination Models, Languages, and Systems-SecCo 2004/congresso_luogo:London/congresso_data:30 August 2004/anno:2005/pagina_da:/pagina_a:105/intervallo_pagine:105
128 (2005): 105–119.
info:cnr-pdr/source/autori:M. ter Beek, G. Lenzini, M. Petrocchi/titolo:Team automata for security--a survey/doi:/rivista:/anno:2005/pagina_da:105/pagina_a:119/intervallo_pagine:105–119/volume:128
ISTI Technical reports, pp.1–14, 2004Témata: access control, security, Cryptographic communication protocols, D.4.6 Security and Protection. Verification, team automata, Team automata, IR-48630, cryptographic communication protocols, METIS-220253, Security, Access control, EWI-751, F.1. Models of Computation. Automata, K.6.5 Security and Protection
Popis souboru: application/pdf
Přístupová URL adresa: http://www.cnr.it/prodotto/i/64053
https://publications.cnr.it/doc/64053
https://publications.cnr.it/doc/173994
http://www.cnr.it/prodotto/i/173994
https://research.utwente.nl/en/publications/3d944a04-62b5-41d1-8221-bd888e3c3401
https://doi.org/10.1016/j.entcs.2004.11.044
https://hdl.handle.net/20.500.14243/24758 -
5
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors D.2.4 [Software Engineering, Software/Program Verification—Model Checking, F.1.1 [Computation by Abstract Devices, Models of Computation—Automata, F.1.2 [Computation by Abstract Devices, Modes of Computation—Alternation and Nodeterminism Keywords hypergraphs, heaps, pointers, verification, shape analysis, finite tree automata, forest automata
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.7555; http://acmbulletin.fiit.stuba.sk/vol5num1/simacek.pdf
-
6
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors F.1.1 [Computation by Abstract Devices, Models of Computation—Automata
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.5684; http://impact.asu.edu/publication/ICCPSRevisionVer2ChangesMarked.pdf
-
7
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors. F.1.1 [Computation by Abstract Devices, Models of Computation—Automata, H.2.1 [Database Management, Logical Design—Data Models, H.2.3 [Database management, Languages—Query Languages, I.7.2 [Document and Text Processing, Document Preparation—Markup languages
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.2888; http://homepages.inf.ed.ac.uk/libkin/papers/icdt12a.pdf
-
8
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, F.1.1 [Computation by Abstract Devices, Models of Computation—Automata, F.4.1 [Mathematical logic and formal languages, Mathematical logic, G.1.6 [Numerical Analysis, Optimization—Integer programming, H.2.1 [Database Management, Logical Design—Data Models General Terms, Algorithms, Theory Additional Key Words and Phrases, XML, tree languages, data values, Presburger arithmetic, reasoning, integer linear programming ACM Reference Format
Popis souboru: application/pdf
-
9
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors D.2.4 [Software Engineering, Software/Program Verification—Model Checking, F.1.1 [Computation by Abstract Devices, Models of Computation—Automata, F.1.2 [Computation by Abstract Devices, Modes of Computation—Alternation and Nodeterminism Keywords hypergraphs, heaps, pointers, verification, shape analysis, finite tree automata, forest automata
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.1521; http://acmbulletin.fiit.stuba.sk/abstracts/simacek.pdf
-
10
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors F.1.1 [Computation by Abstract Devices, Models of Computation—Automata, F.4.1 [Mathematical logic and formal languages, Mathematical logic, G.1.6 [Numerical Analysis, Optimization—Integer programming, H.2.1 [Database Management, Logical Design—Data Models General Terms Algorithms, Theory
Popis souboru: application/pdf
-
11
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, H.2.1 [Database Management, Logical Design—Data Models, F.1.1 [Computation by abstract devices, Models of Computation—Automata General Terms, Theory, Languages, Algorithms Additional Key Words and Phrases, Graph databases, conjunctive queries, regular relations, regular path
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.302.4156; http://homepages.inf.ed.ac.uk/s0673998/papers/tods.pdf
-
12
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Formal Languages—Decision problems, F.1.1 [Computation by Abstract Devices, Models of Computation—Automata General Terms, Algorithms, Verification
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.242.9589; http://arxiv.org/pdf/0802.4237v1.pdf
-
13
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Temporal logic, Formal Languages—Decision problems, F.1.1 [Computation by Abstract Devices, Models of Computation—Automata General Terms, Algorithms, Verification Additional Key Words and Phrases, Computational complexity, Expressiveness
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.6121; http://arxiv.org/pdf/cs/0610027v1.pdf
-
14
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, D.2.4 [Software Engineering, Software/Program Verification—Formal methods, F.1.1 [Computation by Abstract Devices, Models of Computation— Automata (e.g, finite, push-down, resource-bounded, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Computational logic, F.4.3 [Mathematical Logic and Formal Languages, Formal Languages—Classes defined by grammars or automata (e.g, context-free languages, regular sets, recursive sets) General Terms, Algorithms, Theory Additional Key Words and Phrases, Decision procedure, finite-state representations, integer and real
Popis souboru: application/pdf
-
15
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.1.1 [Computation by Abstract Devices, Models of Computation—automata, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—computational logic General Terms, Algorithms, Theory Additional Key Words and Phrases, Automata-based Decision Procedures, Presburger Arithmetic, Quantifier Elimination, Complexity
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.2976; http://arxiv.org/pdf/cs/0506008v1.pdf
-
16
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, F.1.1 [Computation by Abstract Devices, Models of Computation--automata, relations between models, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic--model theory, Formal languages--classes defined by grammars or automata General Terms, Languages, Theory, Algorithms Additional Key Words and Phrases, automata, expressiveness, first-order logic, infinite alphabets, monadic second-order logic, pebbles, registers, XML
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.3039; http://alpha.luc.ac.be/~fneven/papers/infinitetocl.ps
-
17
Autoři:
Přispěvatelé:
Témata: CR Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors— compilers, F.1.1 [Computation by Abstract Devices, Models of Computation—automata, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—pattern matching, I.5.4 [Pattern Recognition, Applications—text processing General Terms, Algorithms, Theory Additional Key Words and Phrases, Backtracking, dynamic programming, memoization, tabulation
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.3364; http://www.csc.lsu.edu/~gb/csc4351/Papers/Reps.pdf
-
18
Autoři:
Přispěvatelé:
Témata: F11 [Computation by Abstract Devices]: Models of Computation-Automata (eg, finite, push-down, resource-bounded), Relations between models, F41 [Mathematical Logic and Formal Languages]: Mathematical Logic-Model theory, F43 [Mathematical Logic and Formal Languages]: Formal Languages-Classes defined by gram- mars or automata (eg, context-free languages, regular sets, recursive sets) General Terms: Languages, Theory, Algorithms Additional Key Words and Phrases: Automata, expressiveness, first-order logic, infinite alphabets, monadic second-order logic, pebbles, registers, XML
Popis souboru: application/pdf
Relation: http://hdl.handle.net/1942/590; 435; 403; http://doi.acm.org/10.1145/1013562
-
19
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, F. 1.1 [Computation by Abstract Devices, Models of Computation—automata, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and problems—cornpufafions on discrete smacfares, 1.2.6 [Artificial Intelligence, Learning —concept learnuzg, vzd
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.9556; http://people.csail.mit.edu/rivest/pubs/RS94a.pdf
-
20
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, D.2.4 [Software Engineering, Software/Program Verifica- tion—formal methods, F.1.1 [Computation by Abstract Devices, Models of Computation— automata, F.3.2 [Logics and Meanings of Programs, Semantics of Programming Languages— operational semantics, process models General Terms, Languages, Theory, Verification Additional Key Words and Phrases, Process algebras, value passing, symbolic semantics
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.582.7579; http://www.sti.uniurb.it/bernardo/documents/acmtocl5.pdf
Full Text Finder 
Nájsť tento článok vo Web of Science