Geschäftskunden Kundenprogramme

KI-Beratung Beta
Vor Ort
Merkzettel Warenkorb
  • Produktbild: CONCUR '90: Theories of Concurrency: Unification and Extension
  • Produktbild: CONCUR '90: Theories of Concurrency: Unification and Extension
Band 458

CONCUR '90: Theories of Concurrency: Unification and Extension Theories of Concurrency: Unification and Extension

Aus der Reihe Lecture Notes in Computer Science

Fr. 72.90

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

15.08.1990

Abbildungen

X, 542 p.

Herausgeber

Joseph C.M. Baeten + weitere

Verlag

Springer Berlin

Seitenzahl

542

Maße (L/B/H)

23.5/15.5/3 cm

Gewicht

826 g

Auflage

1990

Sprache

Englisch

ISBN

978-3-540-53048-0

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

15.08.1990

Abbildungen

X, 542 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

542

Maße (L/B/H)

23.5/15.5/3 cm

Gewicht

826 g

Auflage

1990

Sprache

Englisch

ISBN

978-3-540-53048-0

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

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 '90: Theories of Concurrency: Unification and Extension
  • Produktbild: CONCUR '90: Theories of Concurrency: Unification and Extension
  • Partial order semantics of concurrent programs.- SCONE: A simple calculus of nets.- Value-passing in process algebras.- Let's make models.- Ideal specification formalism = expressivity + compositionality + decidability + testability + ....- An axiomatization of Lamport's temporal logic of actions.- Convergence of iteration systems.- Process algebra with a zero object.- On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences.- Verifying temporal properties of processes.- Testing equivalences and fully abstract models for probabilistic processes.- A preorder for partial process specifications.- Back and forth bisimulations.- Reduction and design of well-behaved concurrent systems.- Synthesis rules for Petri nets, and how they lead to new results.- The need for headers: An impossibility result for communication over unreliable channels.- A temporal approach to algebraic specifications.- Superimposition for interacting processes.- An implementation of a translational semantics for an imperative language.- CCSR: A calculus for communicating shared resources.- The linear time - branching time spectrum.- A programming logic for formal concurrent systems.- A new strategy for proving ?-completeness applied to process algebra.- Transition system specifications with negative premises.- Delay-insensitive circuits: An algebraic approach to their design.- Equivalences, congruences, and complete axiomatizations for probabilistic processes.- Rewriting as a unified model of concurrency.- A temporal calculus of communicating systems.- Proving termination of communicating programs.- Factorization of finite state machines under observational equivalence.- Partial order logics for elementary net systems: State- andevent-approaches.- Priority as extremal probability.- A synchronous calculus of relative frequency.- On the compositional checking of validity.- Real-time behaviour of asynchronous agents.- Effective solutions to domain equations an approach to effective denotational semantics.