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
Branching Bisimilarity Checking for PRS
TL;DR: In this paper, it was shown that the branching bisimilarity for both nOCN (normed One Counter Net) and nPA (process algebra) is undecidable.
Book ChapterDOI
Branching Bisimilarity Checking for PRS
TL;DR: It is shown in this paper that the branching bisimilarity for both nOCN and nPA (normed One Counter Net) is undecidable, implying that the question if there are any other models in the hierarchy of PRS (Process Rewrite System) whose branching bis similarity is decidable has a negative answer.
Journal Article
Zero-knowledge proofs and string commitments withstanding quantum attacks
TL;DR: The concept of zero-knowledge (ZK) has become of fundamental importance in cryptography, but in a setting where entities are modeled by quantum computers, classical arguments for proving ZK fail to hold since, in the quantum setting, the concept of rewinding is not generally applicable.
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
TL;DR: This work investigates the possibility of (bi)simulation-like pre- order/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA and visibly one-counter automata, and describes generic methods for complexity upper and lower bounds for a number of studied pre- orders and equivalence like simulation, completed simulation, ready simulation, 2-nested simulation preorders/Equivalences and bisimulation equivalence.
Journal ArticleDOI
Computing logarithms digit-by-digit
TL;DR: An algorithm for computing logarithms of positive real numbers, that bears structural resemblance to the elementary school algorithm of long division, is presented, which can be computed using a 4-operation pocket calculator.
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.