On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Parallel program design: a foundation
Parallel program design: a foundation
Process algebra
Recursive applicative program schemes
Handbook of theoretical computer science (vol. B)
Forward and backward simulations I.: untimed systems
Information and Computation
Branching bisimilarity is an equivalence indeed!
Information Processing Letters
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Formal verification of a leader election protocol in process algebra
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Specification of abstract data types
Specification of abstract data types
Translation validation for an optimizing compiler
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
The parallel composition of uniform processes with data
Theoretical Computer Science
The cones and foci proof technique for timed transition systems
Information Processing Letters
Simulation as a Correct Transformation of Rewrite Systems
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Analysis of a Security Protocol in µCRL
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Checking Verifications of Protocols and Distributed Systems by Computer
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Invariants in Process Algebra with Data
CONCUR '94 Proceedings of the Concurrency Theory
Formal Specification of JavaSpaces Architecture Using µCRL
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
A Provably Correct Embedded Verifier for the Certification of Safety Critical Software
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Towards Rigorous Compiler Implementation Verification
Collaboration between Human and Artificial Societies, Coordination and Agent-Based Distributed Computing
Correct Performance of Transaction Capabilities
ACSD '01 Proceedings of the Second International Conference on Application of Concurrency to System Design
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
Formal Verification of Timed Systems Using Cones and Foci
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld [22], our method is more generally applicable, and does not require a preprocessing step to eliminate τ-loops. We prove soundness of our approach and give an application.