Communicating sequential processes
Communicating sequential processes
Discrete event modelling on SIMULA
Discrete event modelling on SIMULA
Principles of concurrent and distributed programming
Principles of concurrent and distributed programming
Proof systems for satisfiability in Hennessy-Milner logic with recursion
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
A domain equation for bisimulation
Information and Computation
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
Authentication in distributed systems: theory and practice
ACM Transactions on Computer Systems (TOCS)
A calculus for access control in distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication and concurrency
A process algebra of communicating shared resources with dense time and priorities
Theoretical Computer Science
A denotational semantics for a process-based simulation language
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
BI as an assertion language for mutable data structures
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modal and temporal properties of processes
Modal and temporal properties of processes
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Practical Performance Analyst
The Practical Performance Analyst
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A simple process algebra based on atomic actions with resources
Mathematical Structures in Computer Science
Possible worlds and resources: the semantics of BI
Theoretical Computer Science - Mathematical foundations of programming semantics
The semantics of BI and resource tableaux
Mathematical Structures in Computer Science
A Calculus and logic of resources and processes
Formal Aspects of Computing
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Economic aspects of a utility computing service
Proceedings of the first international conference on Networks for grid applications
Exploring the relation between intuitionistic bi and boolean bi: An unexpected embedding
Mathematical Structures in Computer Science
Counting the Cost in the Picalculus (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebra and logic for resource-based systems modelling
Mathematical Structures in Computer Science
Semantics for structured systems modelling and simulation
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
A games model of bunched implications
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Hi-index | 0.00 |
We describe a programme of research in resource semantics, concurrency theory, bunched logic, and stochastic processes, as applied to mathematical systems modelling. Motivated by a desire for structurally and semantically rigorous discrete event modelling tools, applicable to enterprise-scale as well as component-scale systems, we introduce a new approach to compositional reasoning based on a development of SCCS with 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 simple denotational semantics as a parametrization of Abramsky's synchronization trees semantics for SCCS. We also 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. We discuss applications to ideas such as location and access control.