Trace- and Failure-Based Semantics for Bounded Responsiveness
We study open systems modeled as Petri nets with an interface for asynchronous communication with other open systems. As a minimal requirement for successful communication, we investigate bounded responsiveness, which guarantees that an open system and its environment always have the possibility to communicate, while the number of pending messages never exceeds a previously known bound. Bounded responsiveness accordance describes when one open system can be safely replaced by another open system. We present a trace-based characterization for accordance. As this relation turns out not to be compositional (i.e., it is no precongruence), we characterize the coarsest compositional relation (i.e., the coarsest precongruence) that is contained in this relation, using a variation of should testing, and show decidability.
Unable to display preview. Download preview PDF.
- 5.Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S.K., Zufferey, D.: P: safe asynchronous event-driven programming. In: PLDI 2013, pp. 321–332. ACM (2013)Google Scholar
- 14.Müller, R.: On the notion of deadlocks in open nets. In: AWPN 2010. CEUR WS Proc., vol. 643, pp. 130–135 (2010)Google Scholar
- 15.Papazoglou, M.P.: Web Services: Principles and Technology. Pearson (2007)Google Scholar
- 20.Vogler, W., Stahl, C., Müller, R.: A trace-based semantics for responsiveness. In: ACSD 2012, pp. 42–51. IEEE (2012)Google Scholar
- 21.Wolf, K.: Does my service have partners? In: Jensen, K., van der Aalst, W.M.P. (eds.) ToPNoC II. LNCS, vol. 5460, pp. 152–171. Springer, Heidelberg (2009)Google Scholar