CONCUR'97: Concurrency Theory 8th International Conference, Warsaw, Poland, July 1-4, 1997, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Mazurkiewicz, Antoni (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Winkowski, Jozef (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
• Έκδοση: 1st ed. 1997.
• Σειρά: Lecture Notes in Computer Science, 1243
• Θέματα: Architecture, Computer.; Programming languages (Electronic computers).; Computer logic.; Computers.; Computer programming.; Computer communication systems.; Computer System Implementation.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Computation by Abstract Devices.; Programming Techniques.; Computer Communication Networks.

This book constitutes the refereed proceedings of the 8th International Conference on Concurrency Theory, CONCUR'97. held in Warsaw, Poland, in July 1997. The 24 revised full papers presented were selected by the program committee for inclusion in the volume from a total of 41 high-quality subm...

Πίνακας περιεχομένων:

• Recent developments in the mathematics of reactive systems (extended abstract)
• Partial-order reduction in the weak modal mu-calculus
• Cyclic vector languages
• A product version of dynamic linear time temporal logic
• Reasoning about cryptographic protocols in the spi calculus
• Modularity for timed and hybrid systems
• A universal reactive machine
• Bounded stacks, bags and queues
• Adding partial orders to linear temporal logic
• Reachability analysis of pushdown automata: Application to model-checking
• Synthesis of nets with inhibitor arcs
• An algebraic theory of multiple clocks
• Horizontal and vertical structuring techniques for statecharts
• Implicit typing à la ML for the join-calculus
• Proving safety properties of infinite state systems by compilation into Presburger arithmetic
• Axiomatizing flat iteration
• Probabilistic concurrent constraint programming
• On the complexity of verifying concurrent transition systems
• Fair simulation
• High level expressions with their SOS semantics
• How to Parallelize sequential processes
• Causal ambiguity and partial orders in event structures
• Model checking PA-processes
• Bisimulation and propositional intuitionistic logic
• A rigorous analysis of concurrent operations on B-trees
• First-order axioms for asynchrony
• On implementations and semantics of a concurrent programming language
• Algebraic characterization of petri net pomset semantics.