Vor Ort
Merkzettel Warenkorb
  • Produktbild: CONCUR '96: Concurrency Theory
  • Produktbild: CONCUR '96: Concurrency Theory
Band 1119

CONCUR '96: Concurrency Theory 7th International Conference, Pisa, Italy, August 26 - 29, 1996. Proceedings

Aus der Reihe Lecture Notes in Computer Science

97,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

07.08.1996

Abbildungen

XIII, 759 p.

Herausgeber

Ugo Montanari + weitere

Verlag

Springer Berlin

Seitenzahl

759

Maße (L/B/H)

23,5/15,5/4,2 cm

Gewicht

1147 g

Auflage

1996

Sprache

Englisch

ISBN

978-3-540-61604-7

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

07.08.1996

Abbildungen

XIII, 759 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

759

Maße (L/B/H)

23,5/15,5/4,2 cm

Gewicht

1147 g

Auflage

1996

Sprache

Englisch

ISBN

978-3-540-61604-7

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 '96: Concurrency Theory
  • Produktbild: CONCUR '96: Concurrency Theory
  • Retracing some paths in process algebra.- Process calculus based upon evaluation to committed form.- A process algebra with distributed priorities.- Symbolic transition graph with assignment.- Models for concurrent constraint programming.- Comparing transition systems with independence and asynchronous transition systems.- A presheaf semantics of value-passing processes.- Elementary control structures.- On transformations of concurrent object programs.- On bisimulations for the asynchronous ?-calculus.- On the expressiveness of internal mobility in name-passing calculi.- Decoding choice encodings.- Infinite results.- Decidability of bisimulation equivalence for normed pushdown processes.- The modal mu-calculus alternation hierarchy is strict.- Bisimulation collapse and the process taxonomy.- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic.- A Facile tutorial.- Testing probabilistic automata.- Extended Markovian Process Algebra.- Rewriting logic as a semantic framework for concurrency: a progress report.- Truly concurrent constraint programming.- Constraints as processes.- A calculus of mobile agents.- Algebraic interpretation of lambda calculus with resources.- Concurrent graph and term graph rewriting.- Petri boxes and finite precedence.- Constrained properties, semilinear systems, and Petri nets.- Linear constraint systems as high-level nets.- A space-efficient on-the-fly algorithm for real-time model checking.- State equivalences for rectangular hybrid automata.- Verifying abstractions of timed systems.- Towards automatic temporal logic verification of value passing process algebra using abstract interpretation.- Modelling and verification of Distributed Algorithms.- An algorithmic approach for checkingclosure properties of ?-regular languages.- Towards automata for branching time and partial order.- Asynchronous cellular automata for pomsets without auto-concurrency.- Action refinement and property inheritance in systems of sequential agents.- A calculus for concurrent objects.- Refinement in Interworkings.- Equivalences of Statecharts.- Modular verification for shared-variable concurrent programs.- The impact of hardware models on shared memory consistency conditions.- Synchronous development of asynchronous systems.