Abstract
We revise the accordance preorder in the context of deadlock freedom for asynchronously communicating services. Accordance considers all controllers of a service—that is, all environments that can interact with the service without deadlocking. A service Impl accords with a service Spec if every controller of Spec is also a controller of Impl. We model finite-state and infinite-state services as Petri nets and formalize the semantics of such models with a traditional concurrency semantics, a trace-based semantics. As benefits, we get an easier characterization of the accordance preorder, prove that it is a fully abstract precongruence, and present an algorithm to decide refinement of two finite-state services. Previously, operating guidelines have been introduced to study the behavior of finite-state services; they characterize all controllers of a given service and can be used to decide accordance. An operating guideline is a finite automaton annotated with Boolean formulae that describes the semantics of a service from the perspective of its controllers rather than from the perspective of the service. We show that our trace-based semantics can be translated back and forth into operating guidelines, thereby providing a more conceptual understanding of operating guidelines.
Similar content being viewed by others
References
Boreale M., De Nicola R., Pugliese R.: Trace and testing equivalence on asynchronous processes. Inf. Comput. 172(2), 139–164 (2002)
Brookes S.D., Hoare C.A.R., Roscoe A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560–599 (1984)
de Alfaro, L., Henzinger, T.A.: Interface automata. In: ESEC/SIGSOFT FSE 2001, pp. 109–120 (2001)
de Boer, F.S., Kok, J.N., Palamidessi, C., Rutten, J.J.M.M.: The failure of failures in a paradigm for asynchronous communication. In: CONCUR 1991, LNCS, vol. 527, pp. 111–126. Springer (1991)
De Nicola R.: Extensional equivalences for transition systems. Acta Inf. 24(2), 211–237 (1987)
De Nicola R., Hennessy M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83–133 (1984)
Dumas M., van der Aalst W.M.P., ter Hofstede A.H.M.: Process-Aware Information Systems: Bridging People and Software through Process Technology. Wiley, New York (2005)
Fournet, C., Hoare, C.A.R., Rajamani, S.K., Rehof, J.: Stuck-free conformance. In: CAV 2004, LNCS, vol. 3114, pp. 242–254. Springer (2004)
Hopcroft J.E., Ullman J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Laneve, C., Padovani, L.: The must preorder revisited. In: CONCUR 2007, LNCS, vol. 4703, pp. 212–225. Springer (2007)
Lohmann, N., Massuthe, P., Wolf, K.: Operating guidelines for finite-state services. In: ICATPN 2007, LNCS, vol. 4546, pp. 321–341. Springer (2007)
Lohmann, N., Wolf, K.: Petrifying operating guidelines for services. In: ACSD 2009, pp. 80–88. IEEE Computer Society (2009)
Lohmann N., Wolf K.: Compact representations and efficient algorithms for operating guidelines. Fundam. Inform. 107, 1–19 (2011)
Lynch N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)
Milner R.: Fully abstract models of typed lambda-calculi. Theor. Comput. Sci. 4(1), 1–22 (1977)
Mooij, A.J., Voorhoeve, M.: Proof techniques for adapter generation. In: WS-FM 2008, LNCS, vol. 5387, pp. 207–223. Springer (2009)
Papazoglou M.P.: Web Services: Principles and Technology. Pearson, Essex (2007)
Stahl, C., Massuthe, P., Bretschneider, J.: Deciding substitutability of services with operating guidelines. In: ToPNoC II, LNCS 5460, pp. 172–191. Springer (2009)
Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer (1992)
Author information
Authors and Affiliations
Corresponding author
Additional information
An extended abstract appeared under the title “A Trace-Based View on Operating Guidelines” in M. Hofmann, ed., FoSSaCS 2011, vol. 6604 of Lecture Notes in Computer Science, pp. 411–425, Germany, 2011. Springer.
Rights and permissions
About this article
Cite this article
Stahl, C., Vogler, W. A trace-based service semantics guaranteeing deadlock freedom. Acta Informatica 49, 69–103 (2012). https://doi.org/10.1007/s00236-012-0151-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-012-0151-5