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
Journal ArticleDOI
Maker-Maker and Maker-Breaker Games are PSPACE-Complete
TL;DR: The PSPACE-complete problem of deciding the outcome of Maker-Maker and Maker-Breaker games on arbitrary hypergraphs was shown to be PSPACEcomplete in this article.
Book ChapterDOI
Visibly pushdown automata: from language equivalence to simulation and bisimulation
TL;DR: Generic methods for proving complexity upper and lower bounds for a number of studied preorders and equivalences like simulation, completed simulation, ready simulation, 2-nested simulation preorders/equivalences and bisimulation equivalence are described.
Book ChapterDOI
Undecidability results for bisimilarity on prefix rewrite systems
Petr Jancar,Jiri Srba +1 more
TL;DR: Undecidability of bisimilarity is shown on Type -1 systems, even in the normed case, by considering classes of systems that use rewrite rules of the form w and R and showing when they yield low undecidable and high undecido, all with and without the assumption of normedness.
Journal ArticleDOI
Strong Privacy Protection in Electronic Voting
Jens Groth,Gorm Salomonsen +1 more
TL;DR: In this article, a voting scheme based on homomorphic encryption is proposed, where the voter has access to a secondary communication channel through which he can receive information inaccessible to the adversary.
Optimal strategies in priced timed game automata
TL;DR: In this article, the authors prove that the optimal cost for winning a timed game is computable under conditions concerning the non-zenoness of cost, and under stronger conditions (strictness of constraints) they prove that in case an optimal strategy exists, they can compute a state-based winning optimal strategy.
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.