On undecidability of propositional temporal logics on trace systems
Information Processing Letters
Deciding true concurrency equivalences on safe, finite nets
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Deciding History Preserving Bisimilarity
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Controllers for Discrete Event Systems via Morphisms
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
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
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
| Hi-index | 0.89 |