Abstract
This paper provides new insight into the connection between the trace-based lower part of van Glabbeek’s linear-time, branching-time spectrum and its simulation-based upper part. We establish that ready simulation is fully abstract with respect to failures inclusion, when adding the conjunction operator that was proposed by the authors in [TCS 373(1–2):19–40] to the standard setting of labelled transition systems with (CSP-style) parallel composition. More precisely, we actually prove a stronger result by considering a coarser relation than failures inclusion, namely a preorder that relates processes with respect to inconsistencies that may arise under conjunctive composition. Ready simulation is also shown to satisfy standard logic properties and thus commends itself for studying mixed operational and logic languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M., Plotkin, G.D.: A logical view of composition. TCS 114(1), 3–30 (1993)
Bergstra, J.A., Ponse, A., Smolka, S.A.: Handbook of Process Algebra. Elsevier, Amsterdam (2001)
Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can’t be traced. J. ACM 42(1), 232–268 (1995)
Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science, vol. B, pp. 995–1072. North-Holland, Amsterdam (1990)
van Glabbeek, R.: The linear time – branching time spectrum II (1993), available at http://theory.stanford.edu/~rvg/abstracts.html#26
van Glabbeek, R.: The linear time – branching time spectrum I. In: Handbook of Process Algebra, ch. 1, pp. 3–99. Elsevier, Amsterdam (2001)
Graf, S., Sifakis, J.: A logic for the description of non-deterministic programs and their properties. Inform. & Control 68(1–3), 254–270 (1986)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton Univ. Press, Princeton (1994)
Lamport, L.: The temporal logic of actions. TOPLAS 16(3), 872–923 (1994)
Lüttgen, G., Vogler, W.: Conjunction on processes: Full-abstraction via ready-tree semantics. TCS 373(1–2), 19–40 (2007)
Lüttgen, G., Vogler, W.: Ready simulation for concurrency: It’s logical! Techn. rep. 2007-4, Inst. f. Informatik, Univ. Augsburg (2007), http://www.informatik.uni-augsburg.de/forschung/reports/
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Olderog, E.-R.: Nets, Terms and Formulas. Cambridge Tracts in Theoretical Computer Science, vol. 23. Cambridge Univ. Press, Cambridge (1991)
Olderog, E.-R., Hoare, C.A.R.: Specification-oriented semantics for communicating processes. Acta Informatica 23(1), 9–66 (1986)
Steen, M., Derrick, J., Boiten, E., Bowman, H.: Consistency of partial process specifications. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol. 1548, pp. 248–262. Springer, Heidelberg (1998)
Veglioni, S., De Nicola, R.: Possible worlds for process algebras. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 179–193. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lüttgen, G., Vogler, W. (2007). Ready Simulation for Concurrency: It’s Logical!. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-73420-8_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73419-2
Online ISBN: 978-3-540-73420-8
eBook Packages: Computer ScienceComputer Science (R0)