Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
LORETO: a tool for reducing state explosion in verification of LOTOS programs
Software—Practice & Experience
Information Processing Letters
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Theoretical Computer Science - Special issue: Computational systems biology
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Modelling, property verification and behavioural equivalence of lactose operon regulation
Computers in Biology and Medicine
A Calculus of Looping Sequences for Modelling Microbiological Systems
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Probabilistic model checking of complex biological pathways
Theoretical Computer Science
Bio-PEPA: A framework for the modelling and analysis of biological systems
Theoretical Computer Science
Machine learning biochemical networks from temporal logic properties
Transactions on Computational Systems Biology VI
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Hi-index | 0.00 |
We propose an automata-based formalism for the description of biological systems that allows properties expressed in the universal fragment of CTL to be verified in a modular way. As an example we show the modelling of lac operon regulation and the modular verification of some properties.