@TechReport{      bollig:hal-00872807,
  Author        = "Bollig, Benedikt",
  Abstract      = {{We introduce parameterized communicating automata (PCA) as a model of systems where finite-state processes communicate through FIFO channels. Unlike classical communicating automata, a given PCA can be run on any network topology of bounded degree. The topology is thus a parameter of the system. We provide various B{\"u}chi-Elgot-Trakhtenbrot theorems for PCA, which roughly read as follows: Given a logical specification \phi and a class of topologies T, there is a PCA that is equivalent to \phi on all topologies from T. We give uniform constructions which allow us to instantiate T with concrete classes such as pipelines, ranked trees, grids, rings, etc. The proofs build on a locality theorem for first-order logic due to Schwentick and Barthelmann, and they exploit concepts from the non-parameterized case, notably a result by Genest, Kuske, and Muscholl.}},
  affiliation   = "Laboratoire Sp{\'e}cification et V{\'e}rification [Cachan] - LSV",
  date-added    = "2014-03-31 13:06:01 +0000",
  date-modified = "2014-03-31 13:06:01 +0000",
  hal_id        = "hal-00872807",
  Language      = "English",
  PDF           = "http://hal.archives-ouvertes.fr/hal-00872807/PDF/parameterized.pdf",
  Title         = "{Logic for Communicating Automata with Parameterized Topology}",
  URL           = "http://hal.archives-ouvertes.fr/hal-00872807",
  bdsk-url-1    = "http://hal.archives-ouvertes.fr/hal-00872807",
  File          = "Logic for Communicating Automata with Parameterized Topology - Bollig (3) (0) - a - a - j.pdf",
  file-2        = "Logic for Communicating Automata with Parameterized Topology - Bollig (1) (0) - a - a - j.pdf",
  file-3        = "Logic for Communicating Automata with Parameterized Topology - Bollig (0) (0) - a - a - j.pdf"
}

@TechReport{ bollig:hal-00872807, Author = "Bollig, Benedikt", Abstract = {{We introduce parameterized communicating automata (PCA) as a model of systems where finite-state processes communicate through FIFO channels. Unlike classical communicating automata, a given PCA can be run on any network topology of bounded degree. The topology is thus a parameter of the system. We provide various B{\"u}chi-Elgot-Trakhtenbrot theorems for PCA, which roughly read as follows: Given a logical specification \phi and a class of topologies T, there is a PCA that is equivalent to \phi on all topologies from T. We give uniform constructions which allow us to instantiate T with concrete classes such as pipelines, ranked trees, grids, rings, etc. The proofs build on a locality theorem for first-order logic due to Schwentick and Barthelmann, and they exploit concepts from the non-parameterized case, notably a result by Genest, Kuske, and Muscholl.}}, affiliation = "Laboratoire Sp{\'e}cification et V{\'e}rification [Cachan] - LSV", date-added = "2014-03-31 13:06:01 +0000", date-modified = "2014-03-31 13:06:01 +0000", hal_id = "hal-00872807", Language = "English", PDF = "http://hal.archives-ouvertes.fr/hal-00872807/PDF/parameterized.pdf", Title = "{Logic for Communicating Automata with Parameterized Topology}", URL = "http://hal.archives-ouvertes.fr/hal-00872807", bdsk-url-1 = "http://hal.archives-ouvertes.fr/hal-00872807", File = "Logic for Communicating Automata with Parameterized Topology - Bollig (3) (0) - a - a - j.pdf", file-2 = "Logic for Communicating Automata with Parameterized Topology - Bollig (1) (0) - a - a - j.pdf", file-3 = "Logic for Communicating Automata with Parameterized Topology - Bollig (0) (0) - a - a - j.pdf" }