Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Proceedings of the international workshop on Automatic verification methods for finite state systems
An efficient algorithm for branching bisimulation and stuttering equivalence
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Finite representations of CCS and TCSP programs by automata and Petri nets
Finite representations of CCS and TCSP programs by automata and Petri nets
Communication and Concurrency
Local Model Checking in the Modal Mu-Calculus
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Computer Aided Verification of Parallel Processes
VIS '91 Verläßliche Informationssysteme, GI-Fachtagung
Verification in Process Algebra of the Distributed Control of Track Vehicles - A Case Study
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Using a Protean Language to Enhance Expressiveness in Specification
IEEE Transactions on Software Engineering
Toupie: The µ-calculus over Finite Domains as a Constraint Language
Journal of Automated Reasoning
Advances in Model Representations
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Deriving Symbolic Representations from Stochastic Process Algebras
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Model Checking: A Tutorial Overview
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
An Efficient Algorithm to Compute the Synchronized Product
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Norm Functions for Probabilistic Bisimulations with Delays
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Model checking: a tutorial overview
Modeling and verification of parallel processes
Handbook of automated reasoning
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Symbolic partition refinement with automatic balancing of time and space
Performance Evaluation
Genetic algorithms for the variable ordering problem of binary decision diagrams
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
An enhanced flow analysis technique for detecting unreachability faults in concurrent systems
Information Sciences: an International Journal
| Hi-index | 0.00 |
Finite transition systems can easily be represented by binary decision diagrams (BDDs) through the characteristic function of the transition relation. Burch et al. have shown how model checking of a powerful version of the µ-calculus can be performed on such BDDs. In this paper we show how a BDD can be generated from elementary finite transition systems given as BDDs by applying the CCS operations of parallel composition, restriction, and relabelling. The resulting BDDs only grow linearly in the number of parallel components. This way bisimilarity checking can be performed for processes out of the reach of conventional process algebra tools.