80
Voted
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC− . Every formula is translated into an equivalent communicat...
59
Voted
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states ind...