rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: CONCUR'99. Concurrency Theory
    sub title: 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings
  name:
    name part: Baeten, Jos C.M.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Mauw, Sjouke.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 1999
    edition: 1st ed. 1999.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 584 p. online resource.
  table of contents: Invited Lectures -- Temporal Process Logic -- An Unfolding Algorithm for Synchronous Products of Transition Systems -- Petri Nets, Configuration Structures and Higher Dimensional Automata -- Expressiveness and Distributed Implementation of Concurrent Calculi with Link Mobility -- Tutorials -- Techniques for Decidability and Undecidability of Bisimilarity -- Testing Concurrent Systems: A Formal Approach -- Accepted Papers -- Computing Minimum and Maximum Reachability Times in Probabilistic Systems -- Automating Modular Verification -- "Next" Heuristic for On-the-Fly Model Checking -- Model Checking of Message Sequence Charts -- Synthesis of Large Concurrent Programs via Pairwise Composition -- Approximative Symbolic Model Checking of Continuous-Time Markov Chains -- From Synchrony to Asynchrony -- Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic -- Weak and Strong Composition of High-Level Petri Nets -- Model Checking of Time Petri Nets Based on Partial Order Semantics -- Generic Process Algebras for Asynchronous Communication -- Timed Automata and the Theory of Real Numbers -- Metrics for Labeled Markov Systems -- The Expressive Power of Temporal Logic of Actions -- Object Types against Races -- Open Bisimulations on Chi Processes -- Rectangular Hybrid Games -- Localizability of Fairness Constraints and their Distributed Implementations -- Generating Type Systems for Process Graphs -- Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time -- Robust Satisfaction -- Statecharts via Process Algebra -- A Partial Order Event Model for Concurrent Objects -- Partial Order Reduction for Model Checking of Timed Automata -- On the Semantics of Place/Transition Nets -- Validating Firewalls in Mobile Ambients -- On Coherence Properties in Term Rewriting Models of Concurrency -- Synchronous Structures -- Weakest-Congruence Results for Livelock-Preserving Equivalences -- Proof-Checking Protocols Using Bisimulations -- Event Structures as …
  note: edited by Jos C.M. Baeten, Sjouke Mauw.
  subject:
    topic: Applied mathematics
  subject:
    topic: Engineering mathematics
  subject:
    topic: Architecture, Computer
  subject:
    topic: Computer logic
  subject:
    topic: Computers
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computer programming
  subject:
    topic: Applications of Mathematics
  subject:
    topic: Computer System Implementation
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Computation by Abstract Devices
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Programming Techniques
  classification: T57-57.97
  classification: 519
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 1664
  identifier: 9783540483205
  identifier: https://doi.org/10.1007/3-540-48320-9
  record info:
    record creation date: 121227
    record change date: 20191021211551.0
    record identifier: 978-3-540-48320-5