Merkzettel Warenkorb
  • Produktbild: CONCUR 2001 - Concurrency Theory
  • Produktbild: CONCUR 2001 - Concurrency Theory
Band 2154

CONCUR 2001 - Concurrency Theory 12th International Conference, Aalborg, Denmark, August 20-25, 2001 Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Lieferung nach Hause

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

13.08.2001

Herausgeber

Kim G. Larsen + weitere

Verlag

Springer Berlin

Seitenzahl

589

Maße (L/B/H)

23,5/15,5/3,3 cm

Gewicht

830 g

Auflage

2001

Sprache

Englisch

ISBN

978-3-540-42497-0

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

13.08.2001

Herausgeber

Verlag

Springer Berlin

Seitenzahl

589

Maße (L/B/H)

23,5/15,5/3,3 cm

Gewicht

830 g

Auflage

2001

Sprache

Englisch

ISBN

978-3-540-42497-0

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: CONCUR 2001 - Concurrency Theory
  • Produktbild: CONCUR 2001 - Concurrency Theory
  • Invited Talks.- Channel Representations in Protocol Verification.- Bigraphical Reactive Systems.- Control of Networks of Unmanned Vehicles.- Process Algebra and Security (Abstract).- Invited Tutorials.- Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software.- Performance Evaluation:= (Process Algebra + Model Checking) X Markov Chains.- Mobility.- Typing Mobility in the Seal Calculus.- Reasoning about Security in Mobile Ambients.- Synchronized Hyperedge Replacement with Name Mobility.- Dynamic Input/Output Automata: A Formal Model for Dynamic Systems.- Probabilistic Systems.- Probabilistic Information Flow in a Process Algebra.- Symbolic Computation of Maximal Probabilisti Reachability.- Randomized Non-sequential Processes.- Model Checking.- Liveness and Fairness in Process-Algebraic Verification.- Bounded Reachability Checking with Process Semantics.- Techniques for Smaller Intermediary BDDs.- An Algebraic Characterization of Data and Timed Languages.- Process Algebra.- A Faster-than Relation for Asynchronous Processes.- On the Power of Labels in Transition Systems.- On Barbed Equivalences in ?-Calculus.- CCS with Priority Guards.- Probabilistic Systems.- A Testing Theory for Generally Distributed Stochastic Processes.- An Algorithm for Quantitative Verification of Probabilistic Transition Systems.- Compositional Methods for Probabilistic Systems.- Unfoldings and Prefixes.- Towards an Efficient Algorithm for Unfolding Petri Nets.- A Static Analysis Technique for Graph Transformation Systems.- Local First Search — A New Paradigm for Partial Order Reductions.- Extending Memory Consistency of Finite Prefixes to Infinite Computations.- Model Checking.- Abstraction-Based Model Checking Using Modal Transition Systems.- Efficient Multiple-Valued Model-Checking Using Lattice Representations.- Divide and Compose: SCC Refinement for Language Emptiness.- Unavoidable Configurations of Parameterized Rings of Processes.- Logic and Compositionality.- Logic of Global Synchrony.- Compositional Modeling of Reactive Systems Using Open Nets.- Extended Temporal Logic Revisited.- Games.- Symbolic Algorithms for Infinite-State Games.- A Game-Based Verification of Non-repudiation and Fair Exchange Protocols.- The Control of Synchronous Systems, Part II.