17 search results - page 1 / 4 » On the complexity of checking semantic equivalences between ... |
IANDC
2010
13 years 3 months ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
CSL
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
SIGSOFT
2009
ACM
14 years 5 months ago
2009
ACM
Many testing and analysis techniques use finite state models to validate and verify the quality of software systems. Since the specification of such models is complex and timecons...
UML
2005
Springer
13 years 10 months ago
2005
Springer
We present in this paper a rigorous and automated based approach for the behavioral validation of control software systems. This approach relies on metamodeling, model-transformati...