×

Relating reasoning methodologies in linear logic and process algebra. (English) Zbl 1459.68139

Alves, Sandra (ed.) et al., Proceedings of the 2nd international workshop on linearity, Tallinn, Estonia, April 1, 2012. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 101, 50-60 (2012).
Summary: We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The argument makes use of other standard notions in process algebra, namely a labeled transition system and a coinductively defined simulation relation. This result establishes a connection between an approach to reason about process specifications and a method to reason about logic specifications.
For the entire collection see [Zbl 1415.68011].

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
03F52 Proof-theoretic aspects of linear logic and other substructural logics
68Q60 Specification and verification (program logics, model checking, etc.)
PDFBibTeX XMLCite
Full Text: arXiv Link