Towards a truly concurrent model for processes sharing resources

Conventional theories of concurrency reduce parallel processes to sequential ones. Here, we propose a true concurrency trace model which takes variables of parallel processes as a whole and runs parallel processes as simultaneous updates on variables. By equipping each resource an ownership variable, the model has a uniform treatment to both variable access conflicts and resource conflicts. A denotational semantics based on the model is studied. After that, we show how to use this model to build a correct resource scheduler, and specify pre-compilers such that the resulting systems do not incur conflicts and have less chance of deadlocks.

[1]  Peter W. O'Hearn,et al.  Resources, Concurrency and Local Reasoning , 2004, CONCUR.

[2]  Stephen D. Brookes,et al.  A Semantics for Concurrent Separation Logic , 2004, CONCUR.

[3]  Stephen D. Brookes,et al.  Retracing the Semantics of CSP , 2004, 25 Years Communicating Sequential Processes.

[4]  Paul Gastin,et al.  Resource traces: a domain for processes sharing exclusive resources , 2002, Theor. Comput. Sci..

[5]  He Jifeng,et al.  Resource models and pre-compiler specification for hardware/software co-design language , 2004, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004..

[6]  A. Tarski A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[7]  Paul Gastin,et al.  A truly concurrent semantics for a process algebra using resource pomsets , 2002, Theor. Comput. Sci..

[8]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[9]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[10]  Flemming Nielson,et al.  Semantics with applications - a formal introduction , 1992, Wiley professional computing.