Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of mobile processes, I
Information and Computation
A calculus of mobile processes, II
Information and Computation
Communication and concurrency
Formal verification of parallel programs
Communications of the ACM
Modeling and querying biomolecular interaction networks
Theoretical Computer Science - Special issue: Computational systems biology
Probabilistic model checking in practice: case studies with PRISM
ACM SIGMETRICS Performance Evaluation Review
Essentiality and damage in metabolic networks
Bioinformatics
Logical Analysis of Biological Systems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Modeling and property verification of lactose operon regulation
BSB'05 Proceedings of the 2005 Brazilian conference on Advances in Bioinformatics and Computational Biology
The biochemical abstract machine BIOCHAM
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Discrete event multi-level models for systems biology
Transactions on Computational Systems Biology I
ACTLW - An action-based computation tree logic with unless operator
Information Sciences: an International Journal
Equivalence and Discretisation in Bio-PEPA
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Modular Verification of Interactive Systems with an Application to Biology
Electronic Notes in Theoretical Computer Science (ENTCS)
A semantic equivalence for Bio-PEPA based on discretisation of continuous values
Theoretical Computer Science
Equivalences for a biological process algebra
Theoretical Computer Science
Hi-index | 0.00 |
Understanding biochemical pathways is one of the biggest challenges in the field of molecular biology nowadays. Computer science can contribute in this area by providing formalisms and tools to simulate and analyse pathways. One formalism that is suited for modelling concurrent systems is Milner's Calculus of Communicating Systems (CCS). This paper shows the viability of using CCS to model and reason about biochemical networks. As a case study, we describe the regulation of lactose operon. After describing this operon formally using CCS, we validate our model by automatically checking some known properties for lactose regulation. Moreover, since biological systems tend to be very complex, we propose to use multiple descriptions of the same system at different levels of abstraction. The compatibility of these multiple views can be assured via mathematical proofs of observational equivalence.