Basic process algebra with deadlocking states
Theoretical Computer Science
The regular viewpoint on PA-processes
Theoretical Computer Science
Simulation preorder over simple process algebras
Information and Computation
Simulation Preorder on Simple Process Algebras
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the Complexity of Bisimulation Problems for Pushdown Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A Logical Viewpoint on Process-Algebraic Quotients
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
Decidable first-order transition logics for PA-processes
Information and Computation
Decidable first-order transition logics for PA-processes
Information and Computation
Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |