A Semantic Driven Method to Check the Finiteness of CCS Processes
Abstract elided by the publisher.
Related papers
- The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems TOPLAS 1993
- Bisimulation Can't Be Traced POPL 1988
- A Formalism for Real-Time Concurrent Object-Oriented Computing OOPSLA 1992
- Verifying Quantum Communication Protocols with Ground Bisimulation TACAS 2020
- Eager Abstraction for Symbolic Model Checking CAV 2018
- Generating BDDs for Symbolic Model Checking in CCS CAV 1991
- Model Checking of Non-Finite State Processes by Finite Approximations TACAS 1995
- High-performance Visual Semantics Compression for AI-Driven Science PPoPP 2025