Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Concurrency: state models & Java programs
Concurrency: state models & Java programs
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
Compilation and verification of LOTOS specifications
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
SVL: A Scripting Language for Compositional Verification
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
Compilation of LOTOS Abstract Data Types
FORTE '89 Proceedings of the IFIP TC/WG6.1 Second International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols
OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Using a PVS Embedding of CSP to Verify Authentication Protocols
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Compiler Construction Using LOTOS NT
CC '02 Proceedings of the 11th International Conference on Compiler Construction
A Corrected Failure Divergence Model for CSP in Isabelle/HOL
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
Describing and Reasoning on Web Services using Process Algebra
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Tool Support for Model-Based Engineering of Web Service Compositions
ICWS '05 Proceedings of the IEEE International Conference on Web Services
State space reduction for process algebra specifications
Theoretical Computer Science - Algebraic methodology and software technology
Towards a Unifying CSP approach to Hierarchical Verification of Asynchronous Hardware
Electronic Notes in Theoretical Computer Science (ENTCS)
BISIMULATOR: a modular tool for on-the-fly equivalence checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Hi-index | 0.01 |
Many process calculi have been proposed since Robin Milner and Tony Hoare opened the way more than 25 years ago. Although they are based on the same kernel of operators, most of them are incompatible in practice. We aim at reducing the gap between process calculi, and especially making possible the joint use of underlying tool support. Fsp is a widely-used calculus equipped with Ltsa, a graphical and user-friendly tool. Lotos is the only process calculus that has led to an international standard, and is supported by the Cadp verification toolbox. We propose a translation from Fsp to Lotos. Since Fsp composite processes are hard to encode into Lotos, they are translated into networks of automata which are another input language accepted by Cadp. Hence, it is possible to use jointly Ltsa and Cadp to validate Fsp specifications. Our approach is completely automated by a translator tool we implemented.