Inicio > > Programación informática/desarrollo de software > CONCUR 2009 - Concurrency Theory
CONCUR 2009 - Concurrency Theory

CONCUR 2009 - Concurrency Theory

 

132,18 €
IVA incluido
Disponible
Editorial:
Springer Nature B.V.
Año de edición:
2009
Materia
Programación informática/desarrollo de software
ISBN:
9783642040801
132,18 €
IVA incluido
Disponible

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)

Invited Papers.- Perspectives on Transactional Memory.- The Effect of Tossing Coins in Omega-Automata.- Bigraphical Categories.- BlenX Static and Dynamic Semantics.- Contributed Papers.- Flow Policy Awareness for Distributed Mobile Code.- Volume and Entropy of Regular Timed Languages: Discretization Approach.- A Logical Interpretation of the ?-Calculus into the ?-Calculus, Preserving Spine Reduction and Types.- Encoding Asynchronous Interactions Using Open Petri Nets.- Distributed Asynchronous Automata.- Algebra for Infinite Forests with an Application to the Temporal Logic EF.- Deriving Syntax and Axioms for Quantitative Regular Behaviours.- Weighted Bisimulation in Linear Algebraic Form.- A Logic-Based Framework for Reasoning about Composite Data Structures.- Measuring Permissivity in Finite Games.- Contracts for Mobile Processes.- Power of Randomization in Automata on Infinite Strings.- Probabilistic Weighted Automata.- Partially-Commutative Context-Free Processes.- Testing Finitary Probabilistic Processes.- A Demonic Approach to Information in Probabilistic Systems.- HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour.- Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs.- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers.- Model-Checking Games for Fixpoint Logics with Partial Order Models.- Reachability in Succinct and Parametric One-Counter Automata.- Winning Regions of Pushdown Parity Games: A Saturation Method.- Concurrent Kleene Algebra.- Concavely-Priced Probabilistic Timed Automata.- Compositional Control Synthesis for Partially Observable Systems.- Howe’s Method for Calculi with Passivation.- On the Relationship between ?-Calculus and Finite Place/Transition Petri Nets.- Modeling Radio Networks.- Time-Bounded Verification.- Secure Enforcement for Global Process Specifications.- On Convergence of Concurrent Systems under Regular Interactions.- Computing Stuttering Simulations.- Weak Time Petri Nets Strike Back!.- A General Testability Theory.- Counterexamples in Probabilistic LTL Model Checking for Markov Chains.- Query-Based Model Checking of Ad Hoc Network Protocols.- Strict Divergence for Probabilistic Timed Automata.

Artículos relacionados

  • SPARK 2014 Reference Manual
    AdaCore / Altran UK Ltd
    SPARK 2014 is a programming language and a set of verification tools designed to meet the needs of high-assurance software development. SPARK 2014 is based on Ada 2012, both subsetting the language to remove features that defy verification, but also extending the system of contracts and aspects to support modular, formal verification.This manual is available online for free at ...
    Disponible

    19,91 €

  • Software and Intelligent Sciences
    Yingxu Wang
    The junction of software development and engineering combined with the study of intelligence has created a bustling intersection of theory, design, engineering, and conceptual thought. Software and Intelligent Sciences: New Transdisciplinary Findings sits at a crossroads and informs advanced researchers, students, and practitioners on the developments in computer science, theor...
  • Power System Planning Technologies and Applications
    Fawwaz Elkarmi / Nazih Abu Shikhah / Nazih Abu-Shikhah
    Planning is an important function of the management of any business, providing knowledge of future prospects and enabling prudent and appropriate decision-making. Planning is especially critical for power systems, since electricity is a fundamental part of modern societies and many conventional electrical energy resources currently in use are limited. Power System Planning Tech...
  • Concept Parsing Algorithms (CPA) for Textual Analysis and Discovery
    Masha Etkind / Uri Shafrir
    Text analysis tools aid in extracting meaning from digital content. As digital text becomes more and more complex, new techniques are needed to understand conceptual structure. Concept Parsing Algorithms (CPA) for Textual Analysis and Discovery: Emerging Research and Opportunities provides an innovative perspective on the application of algorithmic tools to study unstructured d...
  • Model-Based Design for Effective Control System Development
    Wei Wu
    Control systems are an integral aspect of modern society and exist across numerous domains and applications. As technology advances more and more, the complexity of such systems continues to increase exponentially. Model-Based Design for Effective Control System Development is a critical source of scholarly information on model-centric approaches and implementations for control...
  • Verification, Validation and Testing in Software Engineering
    ...