Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
An efficient algorithm for branching bisimulation and stuttering equivalence
Proceedings of the seventeenth international colloquium on Automata, languages and programming
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluence for process verification
Theoretical Computer Science
Communication and Concurrency
Data Structures and Algorithms
Data Structures and Algorithms
On Confluence in the pi-Calculus
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Confluence of Processes and Systems of Objects
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
State space reduction using partial tau-confluence
State space reduction using partial tau-confluence
Description and formal specification of the Link Layer of P1394
Description and formal specification of the Link Layer of P1394
On Combining Functional Verification and Performance Evaluation Using CADP
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
µCRL: A Toolset for Analysing Algebraic Specifications
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
State Space Reduction of Linear Processes Using Control Flow Reconstruction
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Partial Order Reductions Using Compositional Confluence Detection
FM '09 Proceedings of the 2nd World Congress on Formal Methods
On-the-Fly branching bisimulation minimization for compositional analysis
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
A capability calculus for concurrency and determinism
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
DISTRIBUTOR and BCG_MERGE: tools for distributed explicit state space generation
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Sequential and distributed on-the-fly computation of weak tau-confluence
Science of Computer Programming
| Hi-index | 0.00 |
We present an efficient algorithm to determine the maximal class of confluent Τ -transitions in a labelled transition system. Confluent Τ -transitions are inert with respect to branching bisimulation. This allows to use Τ -priorisation, which means that in a state with a confluent outgoing Τ -transition all other transitions can be removed, maintaining branching bisimulation. In combination with the removal of Τ-loops, and the compression of Τ-sequences this yields an efficient algorithm to reduce the size of large state spaces.