Výsledky vyhledávání - "ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES"

  • Zobrazuji výsledky 1 - 19 z 19
Upřesnit hledání
  1. 1

    On the decidability of the existence of polyhedral invariants in transition systems

    Autoři: David Monniaux VERIMAG (VERIMAG - IMAG) Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes 2016-2019 (UGA 2016-2019 ) a další

    Přispěvatelé: David Monniaux VERIMAG (VERIMAG - IMAG) Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes 2016-2019 (UGA 2016-2019 ) a další

    Zdroj: Acta Informatica. 56:385-389

    Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Computer Science - Programming Languages, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], MSC 68Q17 68Q60 03D80 03D35 03D25 03B35, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.2: Correctness proofs, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.1: Invariants, Programming Languages (cs.PL), Logic in Computer Science (cs.LO)

    Přístupová URL adresa: http://arxiv.org/pdf/1709.04382
    http://arxiv.org/abs/1709.04382
    https://arxiv.org/abs/1709.04382
    https://link.springer.com/article/10.1007/s00236-018-0324-y
    https://dblp.uni-trier.de/db/journals/corr/corr1709.html#abs-1709-04382
    https://link.springer.com/content/pdf/10.1007%2Fs00236-018-0324-y.pdf
    http://arxiv.org/pdf/1709.04382.pdf
    https://hal.archives-ouvertes.fr/hal-01587125

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  2. 2

    Verification of Flat FIFO Systems

    Autoři: Finkel, Alain Praveen, M. Laboratoire Spécification et Vérification Cachan (LSV) a další

    Přispěvatelé: Finkel, Alain Praveen, M. Laboratoire Spécification et Vérification Cachan (LSV) a další

    Zdroj: CONCUR 2019 ; https://hal.science/hal-02267453 ; CONCUR 2019, Aug 2019, AMSTERDAM, Netherlands

    Témata: reachability, FIFO, termination, Infinite state systems, complexity, flat systems, counters, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, [SCCO.COMP]Cognitive science/Computer science, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

    Geografické téma: AMSTERDAM, Netherlands

    Relation: info:eu-repo/semantics/altIdentifier/arxiv/1908.07282; ARXIV: 1908.07282

    Dostupnost: https://hal.science/hal-02267453
    https://hal.science/hal-02267453v1/document
    https://hal.science/hal-02267453v1/file/flat.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  3. 3

    Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems

    Autoři: Mostefaoui, Achour Raynal, Michel Nantes Université, Bibliothèque universitaire a další

    Přispěvatelé: Mostefaoui, Achour Raynal, Michel Nantes Université, Bibliothèque universitaire a další

    Zdroj: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. :381-389

    Témata: FOS: Computer and information sciences, [INFO.INFO-DC]Computer Science [cs]/Distributed, Message type, Computer Science - Information Theory, Information Theory (cs.IT), ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, Process crash failure, 0102 computer and information sciences, 02 engineering and technology, Pro-cess crash failure, Atomic read-write register, ACM: F.: Theory of Computation, Parallel, 01 natural sciences, Sequence number, Asynchronous message-passing system, and Cluster Computing [cs.DC], Computer Science - Distributed, Parallel, and Cluster Computing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), Upper bound

    Popis souboru: application/pdf

    Přístupová URL adresa: http://arxiv.org/pdf/1602.02695
    http://arxiv.org/abs/1602.02695
    https://hal.inria.fr/hal-01271135/document
    http://ui.adsabs.harvard.edu/abs/2016arXiv160202695M/abstract
    https://dblp.uni-trier.de/db/journals/corr/corr1602.html#MostefaouiR16a
    https://hal.inria.fr/hal-01271135
    https://hal.archives-ouvertes.fr/hal-02056409
    https://hal.archives-ouvertes.fr/hal-02056409/document

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  4. 4

    Time-efficient read/write register in crash-prone asynchronous message-passing systems

    Autoři: Matthieu Roy Michel Raynal Achour Mostefaoui a další

    Přispěvatelé: Matthieu Roy Michel Raynal Achour Mostefaoui a další

    Zdroj: Lecture Notes in Computer Science ISBN: 9783319461397

    Témata: Synchronous behavior, FOS: Computer and information sciences, [INFO.INFO-DC]Computer Science [cs]/Distributed, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES/D.1.3: Concurrent Programming/D.1.3.0: Distributed programming, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, Process crash failure, Time-efficient operation, Atomic read/write register, 0102 computer and information sciences, 02 engineering and technology, ACM: D.: Software, Parallel, 01 natural sciences, Asynchronous message-passing system, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES/D.1.3: Concurrent Programming, and Cluster Computing [cs.DC], Computer Science - Distributed, Parallel, and Cluster Computing, Concurrency, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), Fast operation

    Popis souboru: application/pdf

    Přístupová URL adresa: http://arxiv.org/pdf/1601.04820
    http://arxiv.org/abs/1601.04820
    https://inria.hal.science/hal-01256067v1
    https://inria.hal.science/hal-01256067v1/document
    https://laas.hal.science/hal-01784210v1
    https://doi.org/10.1007/s00607-018-0615-8
    https://laas.hal.science/hal-01784210v1/document
    https://dblp.uni-trier.de/db/journals/computing/computing101.html#MostefaouiRR19
    https://hal.laas.fr/hal-01784210
    https://link.springer.com/article/10.1007/s00607-018-0615-8
    https://hal.archives-ouvertes.fr/hal-01784210
    https://hal.laas.fr/hal-01784210/document
    https://link.springer.com/content/pdf/10.1007%2Fs00607-018-0615-8.pdf
    https://hal.archives-ouvertes.fr/hal-02056397/document
    https://link.springer.com/chapter/10.1007%2F978-3-319-46140-3_21
    https://hal.archives-ouvertes.fr/hal-02056397
    https://dblp.uni-trier.de/db/journals/corr/corr1601.html#MostefaouiR16
    https://doi.org/10.1007/978-3-319-46140-3_21
    https://hal.inria.fr/hal-01256067

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  5. 5

    Smart Contracts that are Smart and can function as Legal Contracts ; Smart Contracts that are Smart and can function as Legal Contracts : A Review of Semantic Blockchain and Distributed Ledger Technologies

    Autoři: von Wendland, Marcelle Bancstreet Capital Partners Ltd (BST)

    Přispěvatelé: von Wendland, Marcelle Bancstreet Capital Partners Ltd (BST)

    Zdroj: https://hal.inria.fr/hal-01777510 ; 2018.

    Témata: Blockchain Technology, Smart Contracts, Distributed Ledger Technology, Semantic technology, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.3: Language Constructs and Features, ACM: K.: Computing Milieux/K.5: LEGAL ASPECTS OF COMPUTING, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]

    Relation: hal-01777510; https://hal.inria.fr/hal-01777510; https://hal.inria.fr/hal-01777510/document; https://hal.inria.fr/hal-01777510/file/SemBlockChain_OpenAccess_April2018.pdf

    Dostupnost: https://hal.inria.fr/hal-01777510
    https://hal.inria.fr/hal-01777510/document
    https://hal.inria.fr/hal-01777510/file/SemBlockChain_OpenAccess_April2018.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  6. 6

    Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots

    Autoři: Devismes, Stéphane Petit, Franck Tixeuil, Sébastien a další

    Přispěvatelé: Devismes, Stéphane Petit, Franck Tixeuil, Sébastien a další

    Zdroj: Lecture Notes in Computer Science ISBN: 9783642114755

    Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Obliviousness, Computational Complexity (cs.CC), 01 natural sciences, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, Computer Science - Robotics, [INFO.INFO-MC] Computer Science [cs]/Mobile Computing, Computer Science - Data Structures and Algorithms, Mobile robots, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], Data Structures and Algorithms (cs.DS), Ring exploration, [INFO.INFO-DC]Computer Science [cs]/Distributed, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-RB] Computer Science [cs]/Robotics [cs.RO], ACM: F.: Theory of Computation, Parallel, Anonimity, Probabilistic algorithm, Computer Science - Computational Complexity, and Cluster Computing [cs.DC], Computer Science - Distributed, Parallel, and Cluster Computing, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Exploration, Distributed, Parallel, and Cluster Computing (cs.DC), Robots, Robotics (cs.RO)

    Popis souboru: application/pdf

    Přístupová URL adresa: http://arxiv.org/abs/0902.1834
    https://inria.hal.science/inria-00360305v1/document
    https://inria.hal.science/inria-00360305v1
    https://hal.archives-ouvertes.fr/hal-01295189
    https://arxiv.org/pdf/0902.1834
    https://rd.springer.com/chapter/10.1007/978-3-642-11476-2_16
    https://arxiv.org/abs/0902.1834
    https://link.springer.com/10.1007/978-3-642-11476-2_16
    https://hal.inria.fr/inria-00360305
    https://hal.archives-ouvertes.fr/hal-00930045
    https://hal.inria.fr/hal-00930045
    https://www.sciencedirect.com/science/article/pii/S030439751300443X
    https://dblp.uni-trier.de/db/journals/tcs/tcs498.html#DevismesPT13
    https://www.sciencedirect.com/science/article/abs/pii/S030439751300443X
    https://hal.science/hal-01295189v1
    https://doi.org/10.1007/978-3-642-11476-2_16

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  7. 7

    Undecidable Properties of Limit Set Dynamics of Cellular Automata

    Autoři: Di Lena, Pietro Margara, Luciano Dipartimento di Scienze dell'Informazione Bologna (DISI) a další

    Přispěvatelé: Di Lena, Pietro Margara, Luciano Dipartimento di Scienze dell'Informazione Bologna (DISI) a další

    Zdroj: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009
    https://inria.hal.science/inria-00359623
    26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.337-348

    Témata: Cellular Automata, Undecidability, Symbolic Dynamics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]

    Geografické téma: Freiburg, Germany

    Relation: info:eu-repo/semantics/altIdentifier/arxiv/0902.1441; inria-00359623; https://inria.hal.science/inria-00359623; https://inria.hal.science/inria-00359623/document; https://inria.hal.science/inria-00359623/file/dilena_new.pdf; ARXIV: 0902.1441

    Dostupnost: https://inria.hal.science/inria-00359623
    https://inria.hal.science/inria-00359623/document
    https://inria.hal.science/inria-00359623/file/dilena_new.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  8. 8

    Qualitative Reachability in Stochastic BPA Games

    Autoři: Brazdil, Tomas Brozek, Vaclav Kucera, Antonin a další

    Přispěvatelé: Brazdil, Tomas Brozek, Vaclav Kucera, Antonin a další

    Zdroj: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009
    https://inria.hal.science/inria-00359186
    26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.207-218

    Témata: Stochastic games, reachability, pushdown automata, ACM: G.: Mathematics of Computing/G.3: PROBABILITY AND STATISTICS, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]

    Geografické téma: Freiburg, Germany

    Relation: inria-00359186; https://inria.hal.science/inria-00359186; https://inria.hal.science/inria-00359186/document; https://inria.hal.science/inria-00359186/file/17-brazdil.pdf

    Dostupnost: https://inria.hal.science/inria-00359186
    https://inria.hal.science/inria-00359186/document
    https://inria.hal.science/inria-00359186/file/17-brazdil.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  9. 9

    Wait-freedom and Locality are not Incompatible (with Distributed Ring Coloring as an Example)

    Autoři: Castañeda, Armando Delporte, Carole Fauconnier, Hugues a další

    Přispěvatelé: Castañeda, Armando Delporte, Carole Fauconnier, Hugues a další

    Zdroj: https://inria.hal.science/hal-01265958 ; 2016.

    Témata: Asynchronous distributed computing, Cole and Vishkin's coloring algorithm, Locality of a computation, Process crash failure, Synchronous communication, Vertex coloring problem, Wait-freedom, ACM: F.: Theory of Computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO]Computer Science [cs], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

    Dostupnost: https://inria.hal.science/hal-01265958
    https://inria.hal.science/hal-01265958v1/document
    https://inria.hal.science/hal-01265958v1/file/Synchrone-asynchrone-V31.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  10. 10

    Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems

    Autoři: Mostefaoui, Achour Raynal, Michel Laboratoire d'Informatique de Nantes Atlantique (LINA) a další

    Přispěvatelé: Mostefaoui, Achour Raynal, Michel Laboratoire d'Informatique de Nantes Atlantique (LINA) a další

    Zdroj: https://inria.hal.science/hal-01256067 ; [Research Report] IRISA. 2016, pp.14.

    Témata: Fast operation, Atomic read/write register, Concurrency, Asynchronous message-passing system, Process crash failure, Synchronous behavior, Time-efficient operation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: D.: Software, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES/D.1.3: Concurrent Programming, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES/D.1.3: Concurrent Programming/D.1.3.0: Distributed programming, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

    Relation: info:eu-repo/semantics/altIdentifier/arxiv/1601.04820; ARXIV: 1601.04820

    Dostupnost: https://inria.hal.science/hal-01256067
    https://inria.hal.science/hal-01256067/document
    https://inria.hal.science/hal-01256067/file/Fast-operations-RW-V10.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  11. 11

    Atomic Read/Write Memory in Signature-free Byzantine Asynchronous Message-passing Systems ; Mémoire partagée fiable dans les systèmes asynchrones avec processus Byzantins

    Autoři: Mostefaoui, Achour Petrolia, Matoula Raynal, Michel a další

    Přispěvatelé: Mostefaoui, Achour Petrolia, Matoula Raynal, Michel a další

    Zdroj: https://inria.hal.science/hal-01238765 ; 2015.

    Témata: Reliable broadcast abstraction, Linearizability, Byzantine process, Asynchronous message-passing system, Atomic read/write register, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability, ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.4: Communications Management, [INFO]Computer Science [cs]

    Dostupnost: https://inria.hal.science/hal-01238765
    https://inria.hal.science/hal-01238765/document
    https://inria.hal.science/hal-01238765/file/RR-2028-SeqNb-Byz-memmory.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  12. 12

    Optimal Collision/Conflict-free Distance-2 Coloring in Synchronous Broadcast/Receive Tree Networks

    Autoři: Frey, Davide Lakhlef, Hicham Raynal, Michel a další

    Přispěvatelé: Frey, Davide Lakhlef, Hicham Raynal, Michel a další

    Zdroj: https://inria.hal.science/hal-01248428 ; [Research Report] 2030, IRISA, Inria Rennes. 2015, pp.19.

    Témata: Broadcast/receive communication, Collision, Conflict, Distance-2 graph coloring, Message-passing, Network traversal, Synchronous system, Time slot assignment, Tree network, Wireless network, ACM: F.: Theory of Computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO]Computer Science [cs]

    Relation: Report N°: 2030

    Dostupnost: https://inria.hal.science/hal-01248428
    https://inria.hal.science/hal-01248428v2/document
    https://inria.hal.science/hal-01248428v2/file/D2-coloring-V18.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  13. 13

    Communication and Agreement Abstractions in the Presence of Byzantine Processes

    Autoři: Mostefaoui, Achour Raynal, Michel As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP) a další

    Přispěvatelé: Mostefaoui, Achour Raynal, Michel As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP) a další

    Zdroj: https://inria.hal.science/hal-00942889 ; 2014.

    Témata: Abstraction level, Agreement, Asynchronous message-passing system, Broadcast abstraction, Byzantine process, Consensus, Fault-tolerance, Intrusion-tolerance, Message validation, Reliable broadcast, Signature-free algorithm, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

    Dostupnost: https://inria.hal.science/hal-00942889
    https://inria.hal.science/hal-00942889/document
    https://inria.hal.science/hal-00942889/file/RR-Comm-Agreement-Byzantine-processes.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  14. 14

    Generalized Symmetry Breaking Tasks

    Autoři: Castañeda, Armando Imbs, Damien Rajsbaum, Sergio a další

    Přispěvatelé: Castañeda, Armando Imbs, Damien Rajsbaum, Sergio a další

    Zdroj: https://inria.hal.science/hal-00862230 ; 2013.

    Témata: Agreement, Asynchronous read/write model, Coordination, Concurrent object, Crash failure, Decision task, Distributed computability, Non-determinism, Problem hierarchy, Renaming, Set agreement, Symmetry breaking, Wait-freedom, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR]

    Dostupnost: https://inria.hal.science/hal-00862230
    https://inria.hal.science/hal-00862230v2/document
    https://inria.hal.science/hal-00862230v2/file/GSB-Tech-Report.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  15. 15

    A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs

    Autoři: Balabonski, Thibaut Pelle, Robin Rieg, Lionel a další

    Přispěvatelé: Balabonski, Thibaut Pelle, Robin Rieg, Lionel a další

    Zdroj: ICDCN '18 Proceedings of the 19th International Conference on Distributed Computing and Networking ; ICDCN 2018 - 19th International Conference on Distributed Computing and Networking ; https://hal.sorbonne-universite.fr/hal-01753439 ; ICDCN 2018 - 19th International Conference on Distributed Computing and Networking, Jan 2018, Varanasi, India. pp.1-10, ⟨10.1145/3154273.3154321⟩

    Témata: Mobile Robots, Proof Assistant, Exploration, Impossibility results, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES, ACM: D.: Software/D.2: SOFTWARE ENGINEERING, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], [INFO.INFO-IA]Computer Science [cs]/Computer Aided Engineering

    Geografické téma: Varanasi, India

    Dostupnost: https://hal.sorbonne-universite.fr/hal-01753439
    https://doi.org/10.1145/3154273.3154321

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  16. 16

    Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots

    Autoři: Devismes, Stéphane Petit, Franck Tixeuil, Sébastien a další

    Přispěvatelé: Devismes, Stéphane Petit, Franck Tixeuil, Sébastien a další

    Zdroj: https://inria.hal.science/inria-00360305 ; [Research Report] RR-6838, INRIA. 2009, pp.29.

    Témata: Robots, Anonimity, Obliviousness, Exploration, ACM: F.: Theory of Computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]

    Relation: info:eu-repo/semantics/altIdentifier/arxiv/0902.1834; ARXIV: 0902.1834

    Dostupnost: https://inria.hal.science/inria-00360305
    https://inria.hal.science/inria-00360305v1/document
    https://inria.hal.science/inria-00360305v1/file/RR-6838.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  17. 17

    Analysis of Communicating Infinite State Machines using Lattice Automata

    Autoři: Le Gall, Tristan Jeannet, Bertrand Verification models and techniques applied to testing and control of reactive systems (VERTECS) a další

    Přispěvatelé: Le Gall, Tristan Jeannet, Bertrand Verification models and techniques applied to testing and control of reactive systems (VERTECS) a další

    Zdroj: https://inria.hal.science/inria-00140831 ; [Research Report] PI 1839, 2007, pp.36.

    Témata: Asynchronous systems, Abstract interpretation, Verification of infinite systems, FIFO channels, Lattice automata, Interpocedural analysis, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]

    Relation: Report N°: PI 1839

    Dostupnost: https://inria.hal.science/inria-00140831
    https://inria.hal.science/inria-00140831/document
    https://inria.hal.science/inria-00140831/file/PI-1839.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  18. 18

    Abstract Interpretation of FIFO channels

    Autoři: Jeannet, Bertrand Jéron, Thierry Le Gall, Tristan a další

    Přispěvatelé: Jeannet, Bertrand Jéron, Thierry Le Gall, Tristan a další

    Zdroj: https://inria.hal.science/inria-00001031 ; [Research Report] PI 1767, 2005, pp.25.

    Témata: Communicating Finite State Machines, Reachability Analysis, FIFO channels systems, Abstract Interpretation \\ Automates communicants, Analyse d'atteignabilité, Systèmes FIFO, Interprétation Abstraite, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]

    Relation: Report N°: PI 1767

    Dostupnost: https://inria.hal.science/inria-00001031
    https://inria.hal.science/inria-00001031/document
    https://inria.hal.science/inria-00001031/file/PI-1767.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  19. 19

    Programming the quantum future

    Autoři: Valiron, Benoît Ross, Neil J. Selinger, Peter a další

    Přispěvatelé: Valiron, Benoît Ross, Neil J. Selinger, Peter a další

    Zdroj: ISSN: 0001-0782.

    Témata: ACM: B.: Hardware/B.7: INTEGRATED CIRCUITS/B.7.1: Types and Design Styles, ACM: C.: Computer Systems Organization/C.1: PROCESSOR ARCHITECTURES, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph], [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY]

    Dostupnost: https://hal.science/hal-01194416
    https://doi.org/10.1145/2699415

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených

Vyhledávací nástroje: