Book Volume 10139 2017

SOFSEM 2017: Theory and Practice of Computer Science

43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings

ISBN: 978-3-319-51962-3 (Print) 978-3-319-51963-0 (Online)

Table of contents (40 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XVIII

  2. Foundations in Computer Science

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 3-10

      Dependable and Optimal Cyber-Physical Systems

    3. No Access

      Chapter

      Pages 11-14

      Verifying Parametric Thread Creation

    4. No Access

      Chapter

      Pages 15-34

      Network Constructors: A Model for Programmable Matter

  3. Semantics, Specification and Compositionality

    1. Front Matter

      Pages 35-35

    2. No Access

      Chapter

      Pages 37-48

      Logical Characterisations and Compositionality of Input-Output Conformance Simulation

    3. No Access

      Chapter

      Pages 49-61

      A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories

    4. No Access

      Chapter

      Pages 62-75

      Symbolic Semantics for Multiparty Interactions in the Link-Calculus

  4. Theory of Mobile and Distributed Systems

    1. Front Matter

      Pages 77-77

    2. No Access

      Chapter

      Pages 79-90

      Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs

    3. No Access

      Chapter

      Pages 91-102

      Deciding Structural Liveness of Petri Nets

    4. No Access

      Chapter

      Pages 103-115

      Distributed Network Generation Based on Preferential Attachment in ABS

  5. Verification and Automated System Analysis

    1. Front Matter

      Pages 117-117

    2. No Access

      Chapter

      Pages 119-131

      Completeness of Hoare Logic Relative to the Standard Model

    3. No Access

      Chapter

      Pages 132-146

      Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict

    4. No Access

      Chapter

      Pages 147-160

      Hardness of Deriving Invertible Sequences from Finite State Machines

  6. Petri Nets, Games and Relaxed Data Structures

    1. Front Matter

      Pages 161-161

    2. No Access

      Chapter

      Pages 163-175

      A Graph-Theoretical Characterisation of State Separation

    3. No Access

      Chapter

      Pages 176-187

      Selfish Transportation Games

    4. No Access

      Chapter

      Pages 188-202

      Decomposable Relaxation for Concurrent Data Structures

  7. Graph Theory and Scheduling Algorithms

    1. Front Matter

      Pages 203-203

    2. No Access

      Chapter

      Pages 205-216

      Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path

    3. No Access

      Chapter

      Pages 217-228

      Enumerating Minimal Tropical Connected Sets

    4. No Access

      Chapter

      Pages 229-240

      Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)

  8. Quantum and Matrix Algorithms

    1. Front Matter

      Pages 241-241

    2. No Access

      Chapter

      Pages 243-255

      Exact Quantum Query Complexity of \(\text {EXACT}_{k,l}^n\)

    3. No Access

      Chapter

      Pages 256-267

      Adjacent Vertices Can Be Hard to Find by Quantum Walks

previous Page of 2