Bisimulation Minimization in an Automata-Theoretic Verification Framework
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Abstraction in Probabilistic Process Algebra
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Compositional Reasoning in Model Checking
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
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
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
Optimization techniques for BDD-based bisimulation computation
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Quantifying process equivalence based on observed behavior
Data & Knowledge Engineering
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
On the Minimisation of Acyclic Models
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A bisimulation-based approach to the analysis of human-computer interaction
Proceedings of the 1st ACM SIGCHI symposium on Engineering interactive computing systems
Computing Stuttering Simulations
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Specialization of Interaction Protocols in a Temporal Action Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Cones and foci for protocol verification revisited
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Folk theorems on the correspondence between state-based and event-based systems
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Game-theoretic simulation checking tool
Programming and Computing Software
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
Enabling business process interoperability using contract workflow models
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
An abstract interpretation perspective on linear vs. branching time
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
On-the-Fly branching bisimulation minimization for compositional analysis
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
An abstract interpretation-based refinement algorithm for strong preservation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Operational determinism and fast algorithms
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Sigref: a symbolic bisimulation tool box
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Smaller abstractions for ∀CTL* without next
Concurrency, Compositionality, and Correctness
Simulation-based abstractions for software product-line model checking
Proceedings of the 34th International Conference on Software Engineering
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A cure for stuttering parity games
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Efficient property preservation checking of model refinements
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |