The following pages link to CONCUR '97: Concurrency Theory (Q6044104):
Displayed 27 items.
- Partial-order reduction in the weak modal mu-calculus (Q6044105) (← links)
- Cyclic vector languages (Q6044106) (← links)
- A product version of dynamic linear time temporal logic (Q6044107) (← links)
- Reasoning about cryptographic protocols in the spi calculus (Q6044108) (← links)
- Modularity for timed and hybrid systems (Q6044109) (← links)
- A universal reactive machine (Q6044111) (← links)
- Bounded stacks, bags and queues (Q6044112) (← links)
- Adding partial orders to linear temporal logic (Q6044113) (← links)
- Reachability analysis of pushdown automata: Application to model-checking (Q6044114) (← links)
- Synthesis of nets with inhibitor arcs (Q6044115) (← links)
- An algebraic theory of multiple clocks (Q6044116) (← links)
- Horizontal and vertical structuring techniques for statecharts (Q6044117) (← links)
- Implicit typing à la ML for the join-calculus (Q6044118) (← links)
- Proving safety properties of infinite state systems by compilation into Presburger arithmetic (Q6044119) (← links)
- Axiomatizing flat iteration (Q6044120) (← links)
- Probabilistic concurrent constraint programming (Q6044121) (← links)
- On the complexity of verifying concurrent transition systems (Q6044122) (← links)
- Fair simulation (Q6044123) (← links)
- High level expressions with their SOS semantics (Q6044124) (← links)
- How to Parallelize sequential processes (Q6044125) (← links)
- Causal ambiguity and partial orders in event structures (Q6044126) (← links)
- Model checking PA-processes (Q6044127) (← links)
- Bisimulation and propositional intuitionistic logic (Q6044128) (← links)
- A rigorous analysis of concurrent operations on B-trees (Q6044129) (← links)
- First-order axioms for asynchrony (Q6044130) (← links)
- On implementations and semantics of a concurrent programming language (Q6044131) (← links)
- Algebraic characterization of petri net pomset semantics (Q6044132) (← links)