Bisimulation through probabilistic testing (preliminary report)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Structured operational semantics as a specification language
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Modular Specification of Concurrent Systems with Observational Logic
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Model Checking Modal Transition Systems Using Kripke Structures
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
On the Expressiveness of 3-Valued Models
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Process Languages for Rooted Eager Bisimulation
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Testing Theory for Generally Distributed Stochastic Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
A domain equation for refinement of partial systems
Mathematical Structures in Computer Science
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
The compression structure of a process
Information Processing Letters
Compositionality of Hennessy-Milner logic by structural operational semantics
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
A foundation for behavioural conformance in software product line architectures
Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Formalization of test experiments
Programming and Computing Software
The equational theory of prebisimilarity over basic CCS with divergence
Information Processing Letters
On correct and complete strong merging of partial behaviour models
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Systems with priorities: Conformance, testing, and composition
Programming and Computing Software
A Sound Observational Semantics for Modal Transition Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Complete open-state testing of limitedly nondeterministic systems
Programming and Computing Software
A domain equation for bisimulation
Information and Computation
On the computational complexity of bisimulation, redux
Information and Computation
The compression structure of a process
Information Processing Letters
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Interaction semantics with refusals, divergence, and destruction
Programming and Computing Software
Connection between logical and algebraic approaches to concurrent systems†
Mathematical Structures in Computer Science
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Sigref: a symbolic bisimulation tool box
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Information and Computation
Verifying a compiler for java threads
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Testing probabilistic equivalence through Reinforcement Learning
Information and Computation
Hi-index | 0.00 |