research-article

Open access

A Calculus and logic of resources and processes

Authors:

Chris ToftsAuthors Info & Claims

Formal Aspects of Computing, Volume 18, Issue 4

Pages 495 - 517

https://doi.org/10.1007/s00165-006-0018-z

Published: 01 December 2006 Publication History

Abstract

Recent advances in logics for reasoning about resources provide a new approach to compositional reasoning in interacting systems. We present a calculus of resources and processes, based on a development of Milner’s synchronous calculus of communication systems, SCCS, that uses an explicit model of resource. Our calculus models the co-evolution of resources and processes with synchronization constrained by the availability of resources. We provide a logical characterization, analogous to Hennessy–Milner logic’s characterization of bisimulation in CCS, of bisimulation between resource processes which is compositional in the concurrent and local structure of systems.

References

References

[1]

Brémond-Grégoire P and Lee I A process algebra of communicating shared resources with dense time and priorities Theor Comput Sci 1997 189 1–2 179-219

Digital Library

[2]

Brinch Hansen P Structured multiprogramming Comm. ACM 1972 15 7 574-578

Digital Library

[3]

Brinch Hansen P Operating system principles 1973 Englewood Cliffs Prentice Hall

Digital Library

[4]

Brinch Hansen P The origin of concurrent programming 2002 Berlin Heidelberg New York Springer

[5]

Birtwistle G (1979) Demos—discrete event modelling on Simula. Macmillan

[6]

Birtwistle G (1981) Demos implementation guide and reference manual. Technical Report 81/70/22, University of Calgary

[7]

Bergstra JA, Klop JW (1984) The algebra of recursively defined processes and the algebra of regular processes. In: Proceedings of 11th ICALP, LNCS 172

[8]

Birtwistle G and Tofts C An operational semantics of process-orientated simulation languages: part I πDemos Trans Soc Comput Simul 1993 10 4 299-333

[9]

Birtwistle G and Tofts C An operational semantics of process-orientated simulation languages: part II μDemos Trans Soc Comput Simul 1994 11 4 303-336

[10]

Birtwistle G and Tofts C A denotational semantics for a process-based simulation language ACM ToMaCS 1998 8 3 281-305

Digital Library

[11]

Birtwistle G and Tofts C Getting demos models right—part I practice Simul Practice Theor 2000 3 281-305

[12]

Birtwistle G and Tofts C Getting demos models right—part II ... and theory Simul Practice Theor 2000 3 281-305

[13]

Cardelli L and Caires L A spatial logic of concurrency (part i) Inf Comput 2003 186 2 194-235

Digital Library

[14]

Clementson AT (1965) Extended control and simulation language. Comput J 9(3)

[15]

Dam MF (1990) Relevance logic and concurrent computation. Ph.D. thesis, University of Edinburgh

[16]

Dijkstra EW (1968) Cooperating sequential processes. In: Progamming L, Academic Press, Reprinted in [BH02], pp 43–112 New York

[17]

Dijkstra EW Hierarchical ordering of sequential processes Acta Informatica 1971 1 2 115-138 Reprinted in [BH02]

Digital Library

[18]

Dunn JM Gabbay D and Guenthner F Relevant logic and entailment Handbook of philosophical logic, vol III: alternatives to classical logic. number 166 in Synthese Library 1986 Dordrecht D. Reidel 117-224

[19]

Girard J-Y (1987) Linear logic. Theoret Comput Sci, pp. 1–102

[20]

Gastin P and Mislove M A simple process algebra based on atomic actions with resources Math Struct Comput Sci 2004 14 1-55

Digital Library

[21]

Galmiche D, Méry D, Pym D (2002) Resource Tableaux. In: Proceedings of CSL 2002. vol 2471 of LNCS, pp 183–199

[22]

Gunter CA Semantics of programming languages: structures and techniques 1992 Cambridge The MIT Press

Digital Library

[23]

Hoare CAR (1972) Towards a theory of parallel programming. In: Hoare, Perrot (eds) Operating systems techniques. Academic Press, New York Reprinted in [BH02]

[24]

Hoare CAR Monitors: an operating system structuring concept Commun ACM 1974 17 10 549-557

Digital Library

[25]

Hoare C Communicating sequential processes 1985 Englewood Cliffs Prentice-Hall

Digital Library

[26]

Ishtiaq SS, O’Hearn P (2001) BI as an assertion language for mutable data structures. In: 28th ACM-SIGPLAN symposium on principles of programming languages, London, pp 14–26, Association for Computing Machinery

[27]

Kripke SA Semantical considerations on modal logic Acta Philosophica Fennica 1963 16 83-94

[28]

Kripke SA (1965) Semantical analysis of intuitionistic logic I. In: Crossley JN, Dummett MAE (eds) Formal systems and recursive functions, North-Holland, Amsterdam, pp 92–130

[29]

Mazurkiewicz A Trace theory Lecture Notes Comput Sci 1987 255 279-324

[30]

Milner R Calculi for synchrony and asynchrony Theoret Comput Sci 1983 25 3 267-310

[31]

Milner R Communication and concurrency 1989 Englewood Cliffs Prentice-Hall

Digital Library

[32]

Milner R Communication systems and the π-calculus 1999 Cambridge Cambridge University Press

[33]

Owicki S and Gries D Verifying properties of parallel programs: an axiomatic approach Commun ACM 1976 19 5 279-285

Digital Library

[34]

O’Hearn P (2004) Resources, concurrency, and local reasoning. In: Proceedings of Concur 04, London, LNCS. Springer, Berlin Heidelberg New York

[35]

O’Hearn PW and Pym DJ The logic of bunched implications Bull Symbol Logic 1999 5 2 215-244

[36]

Pym DJ, O’Hearn PW, Yang H (2004) Possible worlds and resources: the semantics of BI. Theoret Comput Sci 315(1):257–305. Erratum: p. 285, l. −12: “, for some ” should be “”

[37]

Pym DJ (2002) The semantics and proof theory of the logic of the logic of bunched implications, vol 26 of Applied Logic Series. Kluwer Dordrecht. Errata and Remarks [Pym04] maintained at: http://www.cs.bath.ac.uk/~pym/BI-monograph-errata.pdf

[38]

Pym DJ (2004) Errata and remarks for The semantics and proof theory of the logic of bunched implications implications [Pym02] . Maintained at:http://www.cs.bath.ac.uk/~pym/BI-monograph-errata.pdf

[39]

Reynolds JC (2002) Separation logic: a logic for shared mutable data structures. In: Proceedings of LICS ’02, IEEE Computer Society Press, pp 55–74

[40]

Routley R and Meyer RK The semantics of entailment, II–III J Phils Logic 1972 1 53-73

[41]

Stirling C Modal and temporal properties of processes 2001 Berlin Heidelberg New York Springer

Digital Library

[42]

Tofts C Processes with probability, priority and time Formal Aspects Comput Sci 1994 6 5 536-564

Digital Library

[43]

Tofts C Efficiently modelling resource in a process algebra 2003 Bristol HP Laboratories Technical Report HPL-2003-181

Cited By

Demri SFervari RMansutti A(2021)Internal proof calculi for modal logics with separating conjunctionJournal of Logic and Computation10.1093/logcom/exab01631:3(832-891)Online publication date: 19-May-2021
https://doi.org/10.1093/logcom/exab016
Pym D(2019)Resource semanticsACM SIGLOG News10.1145/3326938.33269406:2(5-41)Online publication date: 22-Apr-2019
https://dl.acm.org/doi/10.1145/3326938.3326940
BÍLKOVÁ MGRECO GPALMIGIANO ATZIMOULIS AWIJNBERG N(2018)THE LOGIC OF RESOURCES AND CAPABILITIESThe Review of Symbolic Logic10.1017/S175502031700034X11:2(371-410)Online publication date: 22-May-2018
https://doi.org/10.1017/S175502031700034X
Show More Cited By

Index Terms

A Calculus and logic of resources and processes

Index terms have been assigned to the content through auto-classification.

Recommendations

A calculus and logic of bunched resources and processes

Mathematical modelling and simulation modelling are fundamental tools of engineering, science, and social sciences such as economics, and provide decision-support tools in management. Mathematical models are essentially deployed at all scales, all ...
The decidability of the intensional fragment of classical linear logic

Intensional classical linear logic (MELL) is proved decidable.Intensional interlinear logic (RLL) is proved decidable.We adapt Kripke's method used to prove decidability for some relevance logics.The semi-relevant RLL emerges as a logic superior to MELL ...
A modal logic internalizing normal proofs

In the proof-theoretic study of logic, the notion of normal proof has been understood and investigated as a metalogical property. Usually we formulate a system of logic, identify a class of proofs as normal proofs, and show that every proof in the ...

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 18, Issue 4

Dec 2006

119 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© British Computer Society 2006.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 December 2006

Accepted: 11 August 2006

Revision received: 23 June 2006

Received: 10 June 2005

Published in FAC Volume 18, Issue 4

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
46
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)6

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Demri SFervari RMansutti A(2021)Internal proof calculi for modal logics with separating conjunctionJournal of Logic and Computation10.1093/logcom/exab01631:3(832-891)Online publication date: 19-May-2021
https://doi.org/10.1093/logcom/exab016
Pym D(2019)Resource semanticsACM SIGLOG News10.1145/3326938.33269406:2(5-41)Online publication date: 22-Apr-2019
https://dl.acm.org/doi/10.1145/3326938.3326940
BÍLKOVÁ MGRECO GPALMIGIANO ATZIMOULIS AWIJNBERG N(2018)THE LOGIC OF RESOURCES AND CAPABILITIESThe Review of Symbolic Logic10.1017/S175502031700034X11:2(371-410)Online publication date: 22-May-2018
https://doi.org/10.1017/S175502031700034X
Lysne OLysne O(2018)Formal MethodsThe Huawei and Snowden Questions10.1007/978-3-319-74950-1_9(75-85)Online publication date: 20-Feb-2018
https://doi.org/10.1007/978-3-319-74950-1_9
FU NZHANG YSHAN LLIU ZPENG H(2017)A Formal Model to Enforce Trustworthiness Requirements in Service CompositionIEICE Transactions on Information and Systems10.1587/transinf.2016EDP7400E100.D:9(2056-2067)Online publication date: 2017
https://doi.org/10.1587/transinf.2016EDP7400
Kamide N(2016)Bunched sequential informationJournal of Applied Logic10.1016/j.jal.2016.02.00315:C(150-170)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1016/j.jal.2016.02.003
Courtault JGalmiche D(2015)A modal separation logic for resource dynamicsJournal of Logic and Computation10.1093/logcom/exv03128:4(733-778)Online publication date: 19-Jun-2015
https://doi.org/10.1093/logcom/exv031
Porello DTroquard N(2015)Non-normal modalities in variants of linear logicJournal of Applied Non-Classical Logics10.1080/11663081.2015.108042225:3(229-255)Online publication date: 19-Nov-2015
https://doi.org/10.1080/11663081.2015.1080422
Kamide N(2013)Temporal BI: Proof system, semantics and translationsTheoretical Computer Science10.1016/j.tcs.2013.04.029492(40-69)Online publication date: Jun-2013
https://doi.org/10.1016/j.tcs.2013.04.029
Teodosiu D(2012)A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable ResourcesElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2012.08.020286(307-321)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1016/j.entcs.2012.08.020
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Figures

Tables

Media

View Issue’s Table of Contents