CONCUR ’97: Concurrency Theory: 8th International Conference Warsaw, Poland, July 1–4, 1997 Proceedings

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 1243

ISBN: 3540631410, 9783540631415

Size: 4 MB (3933538 bytes)

Pages: 428/430

File format:

Language:

Publishing Year:

Category: Tags: , , , , , ,

Jeremy Gunawardena (auth.), Antoni Mazurkiewicz, Józef Winkowski (eds.)3540631410, 9783540631415

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.

Table of contents :
Recent developments in the mathematics of reactive systems (extended abstract)….Pages 1-4
Partial-order reduction in the weak modal mu-calculus….Pages 5-24
Cyclic vector languages….Pages 25-44
A product version of dynamic linear time temporal logic….Pages 45-58
Reasoning about cryptographic protocols in the spi calculus….Pages 59-73
Modularity for timed and hybrid systems….Pages 74-88
A universal reactive machine….Pages 89-103
Bounded stacks, bags and queues….Pages 104-118
Adding partial orders to linear temporal logic….Pages 119-134
Reachability analysis of pushdown automata: Application to model-checking….Pages 135-150
Synthesis of nets with inhibitor arcs….Pages 151-165
An algebraic theory of multiple clocks….Pages 166-180
Horizontal and vertical structuring techniques for statecharts….Pages 181-195
Implicit typing à la ML for the join-calculus….Pages 196-212
Proving safety properties of infinite state systems by compilation into Presburger arithmetic….Pages 213-227
Axiomatizing flat iteration….Pages 228-242
Probabilistic concurrent constraint programming….Pages 243-257
On the complexity of verifying concurrent transition systems….Pages 258-272
Fair simulation….Pages 273-287
High level expressions with their SOS semantics….Pages 288-301
How to Parallelize sequential processes….Pages 302-316
Causal ambiguity and partial orders in event structures….Pages 317-331
Model checking PA-processes….Pages 332-346
Bisimulation and propositional intuitionistic logic….Pages 347-360
A rigorous analysis of concurrent operations on B-trees….Pages 361-375
First-order axioms for asynchrony….Pages 376-390
On implementations and semantics of a concurrent programming language….Pages 391-405
Algebraic characterization of petri net pomset semantics….Pages 406-420

Reviews

There are no reviews yet.

Be the first to review “CONCUR ’97: Concurrency Theory: 8th International Conference Warsaw, Poland, July 1–4, 1997 Proceedings”
Shopping Cart
Scroll to Top