Hardness of preorder checking for basic formalisms
type: Item
instance of: scholarly article
title: Hardness of preorder checking for basic formalisms
zbMATH Open document ID: 1227.68072
author: Laura Bozzelli
author: Axel Legay
author: Sophie Pinchinat
published in: Theoretical Computer Science
publication date: 2011-12-07T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5987005
zbMATH Keywords: behavioral preorders and equivalences
zbMATH Keywords: preorder and equivalence checking
zbMATH Keywords: non-flat finite-state systems
zbMATH Keywords: timed automata
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.08.037
OpenAlex ID: W2001225349
cites work: A theory of timed automata
cites work: Deciding bisimilarity is P-complete
cites work: Alternation
cites work: On the complexity of verifying concurrent transition systems
cites work: Q4252730
cites work: Q4845486
cites work: Q5592246
cites work: Deciding true concurrency equivalences on safe, finite nets
cites work: Equivalence-checking on infinite-state systems: Techniques and results
cites work: Q4508303
cites work: Q3992568
cites work: A Lower Bound on Web Services Composition
cites work: Complexity of equivalence problems for concurrent systems of finite agents
cites work: Q3424633
cites work: Hardness of equivalence checking for composed finite-state systems
cites work: Q4818858
cites work: Verifying abstractions of timed systems
cites work: Q4484486
DOI: 10.1016/J.TCS.2011.08.037
description: scientific article; zbMATH DE number 5987005