Modal Logic and Bisimulation for Generalized Synchronization Trees
pdf
This poster surveys results obtained by the project team in the area of logical characterizations for bisimulation over a general mathematical model for cyber-physical systems (CPSs) called Generalized Synchronization Trees (GSTs). GSTs extend traditional models for discrete-event systems with capabilities for modeling non-discrete behavior, and are intended to serve as a vehicle for giving mathematically well-defined notions of compositions for CPSs. Bisimulation represents a notion of equivalence over GSTs that captures when two GSTs are indistinguishable to an outside observer.
Submitted by Rance Cleaveland
on
pdf
This poster surveys results obtained by the project team in the area of logical characterizations for bisimulation over a general mathematical model for cyber-physical systems (CPSs) called Generalized Synchronization Trees (GSTs). GSTs extend traditional models for discrete-event systems with capabilities for modeling non-discrete behavior, and are intended to serve as a vehicle for giving mathematically well-defined notions of compositions for CPSs. Bisimulation represents a notion of equivalence over GSTs that captures when two GSTs are indistinguishable to an outside observer.
Submitted by Rance Cleaveland
on