On Plain and Hereditary History-Preserving Bisimulation
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A Parametric Analysis of the State Explosion Problem in Model Checking
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Alphabet-Based Synchronisation is Exponentially Cheaper
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The State Explosion Problem from Trace to Bisimulation Equivalence
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
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
The decidability border of hereditary history preserving bisimilarity
Information Processing Letters
Decomposition and complexity of hereditary history preserving bisimulation on BPP
CONCUR 2005 - Concurrency Theory
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
Electronic Notes in Theoretical Computer Science (ENTCS)
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
The decidability border of hereditary history preserving bisimilarity
Information Processing Letters
Hardness of preorder checking for basic formalisms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Hardness of preorder checking for basic formalisms
Theoretical Computer Science
Composition and decomposition in true-concurrency
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Canonizable partial order generators
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
A comparison of succinctly represented finite-state systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |