Modeling and Analysis of Complex Computational Systems

1
Modeling and Analysis of Complex Computational
Systems

• Goals
• Develop formal frameworks for modeling and
  reasoning about complex behavior in distributed
  systems
• Timing-dependent, Hybrid continuous/discrete,
  Probabilistic behavior
• Build language and tool support for our formal
  models

• TIOA
• New composition results for decomposing
  abstraction proofs into smaller pieces (Kaynar,
  Lynch, Segala, Vaandrager, 04)
• Extension of IOA language syntax and semantics
  for timed systems
• Tools for TIOA(Archer, Shvartsman)
• Translator for UPPAAL (Robson, M.Engg Thesis,
  04)
• Interactive proof of abstractions in PVS (Mitra,
  Archer, 04)
• HIOA
• Stability analysis under slow switching checking
  average dwell time
• A formal verification based approach (Mitra,
  Liberzon, 04)
• By solving MILP for constant rate HIOA (in
  progress)
• PIOA
• New composition results (Cheung,
  Segala,Vaandrager)
• Applications to security protocols (Mitchell)