1 option
CONCUR'97: Concurrency Theory : 8th International Conference, Warsaw, Poland, July 1-4, 1997, Proceedings / edited by Antoni Mazurkiewicz, Jozef Winkowski.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1243.
- Lecture Notes in Computer Science, 0302-9743 ; 1243
- Language:
- English
- Subjects (All):
- Computer architecture.
- Programming languages (Electronic computers).
- Computer logic.
- Computers.
- Computer programming.
- Computer networks.
- Computer System Implementation.
- Programming Languages, Compilers, Interpreters.
- Logics and Meanings of Programs.
- Computation by Abstract Devices.
- Programming Techniques.
- Computer Communication Networks.
- Local Subjects:
- Computer System Implementation.
- Programming Languages, Compilers, Interpreters.
- Logics and Meanings of Programs.
- Computation by Abstract Devices.
- Programming Techniques.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (VIII, 428 pages).
- Edition:
- First edition 1997.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
- System Details:
- text file PDF
- Summary:
- 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 submissions. The volume covers all current topics in the science of concurrency theory and its applications, such as reactive systems, hybrid systems, model checking, partial orders, state charts, program logic calculi, infinite state systems, verification, and others.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69188-4
- 9783540691884
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.