Highly Undecidable Questions for Process Algebras
Petr Jancar,Jiri Srba +1 more
TLDR
This work shows Sigma^1_1-completeness of weak bisimilarity for PA (process algebra), and of weak simulation preorder/equivalence for PDA (pushdown automata), PA and PN (Petri nets).Abstract:
We show Sigma^1_1-completeness of weak bisimilarity for PA (process algebra), and of weak simulation preorder/equivalence for PDA (pushdown automata), PA and PN (Petri nets). We also show Pi^1_1-hardness of weak omega-trace equivalence for the (sub)classes BPA (basic process algebra) and BPP (basic parallel processes).read more
Citations
More filters
Posted Content
The Full Abstraction of the UC Framework.
TL;DR: In this article, it was shown that security in the Universal Composability framework (UC) is equivalent to security in probabilistic polynomial time calculus ppc, under active and adaptive adversaries with synchronous and authenticated communication.
Journal ArticleDOI
Refining the Undecidability Border of Weak Bisimilarity
TL;DR: It is shown that the weak bisimulation equivalence problem is undecidable even for normed subclasses of BPA and BPP extended with a finite constraint system.
Journal Article
Refining the Undecidability Border of Weak Bisimilarity.
TL;DR: In this paper, it was shown that weak bisimilarity is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA).
References
More filters
Journal ArticleDOI
Theory of Recursive Functions and Effective Computability.
Solomon Feferman,Hartley Rogers +1 more
TL;DR: Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular and generalizations of recursion theory.
Book
Theory of Recursive Functions and Effective Computability
TL;DR: In this paper, the authors discuss related theories of recursively enumerable sets, degree of un-solvability and turing degrees in particular, and generalizations of recursion theory.
Journal ArticleDOI
Theory of Recursive Functions and Effective Computability
TL;DR: If searching for the ebook by Hartley Rogers Theory of Recursive Functions and Effective Computability in pdf format, then you've come to the faithful site, which presented the complete version of this book in PDF, DjVu, doc, ePub, txt forms.
Book
Elements of the Theory of Computation
TL;DR: Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book, each section is followed by problems.
Book ChapterDOI
The Linear Time - Branching Time Spectrum II
TL;DR: In this paper, semantic equivalences and preorders for sequential systems with silent moves are studied, focusing on the ones that abstract from successful termination, stochastic and real-time aspects of the investigated systems, and the structure of the visible actions systems can perform.