Efficient solution to connectivity problems on hierarchically defined graphs
SIAM Journal on Computing
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Theoretical Computer Science
Deciding true concurrency equivalences on safe, finite nets
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the complexity of verifying concurrent transition systems
Information and Computation
Why Is Simulation Harder than Bisimulation?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th 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
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
Reactive Systems: Modelling, Specification and Verification
Reactive Systems: Modelling, Specification and Verification
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Model checking probabilistic timed automata with one or two clocks
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Information and Computation
Fixpoint Logics over Hierarchical Structures
Theory of Computing Systems
Hardness of preorder checking for basic formalisms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Model-checking hierarchical structures
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We study the succinctness of different classes of succinctly presented finite transition systems with respect to bisimulation equivalence. Our results show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We moreover study the computational complexity of deciding simulation preorder and bisimulation equivalence on these classes.