[PDF] Equivalence and Preorder Checking for Finite-State Systems Rance
www.cis.upenn.edu › PAhandbook
This chapter surveys algorithms for computing semantic equivalences and refine- ment relations, or preorders, over states in finite-state labeled transitions ...
Equivalence and preorder checking for finite-state systems ; Year of Publication, 2001 ; Authors, Cleaveland R, Sokolsky O ; Journal, Handbook of Process Algebra.
Trace preorder/equivalence with a finite-state system is undecidable for BPA and. PDA, but decidable for Petri nets; PN ⊑tr FS and FS ⊑tr PN are decidable ...
In formal verification model checking is one of the most successful approaches; it asks to test automatically whether a given system meets a given ...
Jan 13, 2009 · The main result shows that the respective problems are EXPTIME-hard for all relations between bisimulation equivalence and trace preorder, as ...
This property simplifies tasks like checking equivalence of two formulas and deciding if a given formula is satisfiable or not. Two binary decision diagrams are ...
Missing: Preorder | Show results with:Preorder
The main result shows that the respective problems are EXPTIME-hard for all relations between bisimulation equivalence and trace preorder, as conjectured by ...
Abstract. We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a ...
We study the decidability and computational complexity of checking simulation preorder and equivalence between certain infinite-state systems and finite-state ...