Results 1  10
of
21
Verification on Infinite Structures
, 2000
"... In this chapter, we present a hierarchy of infinitestate systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonlystudied classes of systems such as contextfree and pushdown automata, and Petri net processes. We then examine the ..."
Abstract

Cited by 91 (2 self)
 Add to MetaCart
In this chapter, we present a hierarchy of infinitestate systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonlystudied classes of systems such as contextfree and pushdown automata, and Petri net processes. We then examine the equivalence and regularity checking problems for these classes, with special emphasis on bisimulation equivalence, stressing the structural techniques which have been devised for solving these problems. Finally, we explore the model checking problem over these classes with respect to various linear and branchingtime temporal logics.
Bisimulation collapse and the process taxonomy
 In Proceedings of the 7th International Conference on Concurrency Theory (CONCUR’96), volume 1119 of LNCS
, 1996
"... ..."
Bisimulation equivalence is decidable for normed Process Algebra
 Proceedings of ICALP'99, to appear, Lecture Notes in Computer Science
, 1999
"... We present a procedure for deciding whether two normed PA terms are bisimilar. The procedure is \elementary, " having doubly exponential nondeterministic time complexity. ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
(Show Context)
We present a procedure for deciding whether two normed PA terms are bisimilar. The procedure is \elementary, " having doubly exponential nondeterministic time complexity.
On the Complexity of Bisimulation Problems for Pushdown Automata
 In Proceedings of IFIP TCS’2000, volume 1872 of LNCS
, 2000
"... All bisimulation problems for pushdown automata are at least PSPACEhard. In particular, we show that (1) Weak bisimilarity of pushdown automata and finite automata is PSPACEhard, even for a small fixed finite automaton, (2) Strong bisimilarity of pushdown automata and finite automata is PSPACEhar ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
(Show Context)
All bisimulation problems for pushdown automata are at least PSPACEhard. In particular, we show that (1) Weak bisimilarity of pushdown automata and finite automata is PSPACEhard, even for a small fixed finite automaton, (2) Strong bisimilarity of pushdown automata and finite automata is PSPACEhard, but polynomial for every fixed finite automaton, (3) Regularity (finiteness) of pushdown automata w.r.t. weak and strong bisimilarity is PSPACEhard.
Decidability of bisimulation equivalence for pushdown processes
, 2000
"... We show that bisimulation equivalence is decidable for pushdown automata without ǫtransitions. 1 ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
(Show Context)
We show that bisimulation equivalence is decidable for pushdown automata without ǫtransitions. 1
On the Complexity of Deciding Behavioural Equivalences and Preorders  A Survey
, 1996
"... This paper gives an overview of the computational complexity of all the equivalences in the linear/branching time hierarchy [vG90a] and the preorders in the corresponding hierarchy of preorders. We consider finite state or regular processes as well as infinitestate BPA [BK84b] processes. A disti ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This paper gives an overview of the computational complexity of all the equivalences in the linear/branching time hierarchy [vG90a] and the preorders in the corresponding hierarchy of preorders. We consider finite state or regular processes as well as infinitestate BPA [BK84b] processes. A distinction
On the Complexity of Bisimulation Problems for Basic Parallel Processes
 In Proc. of ICALP'2000, volume ? of LNCS
, 2000
"... Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has nonelementary complexity [7]. On the other hand, no lower bound for the problem was known. We show that strong bisimilarity of BPP is coNPhard. Weak bisimilarity of BPP is not known to be decidabl ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has nonelementary complexity [7]. On the other hand, no lower bound for the problem was known. We show that strong bisimilarity of BPP is coNPhard. Weak bisimilarity of BPP is not known to be decidable, but an NP lower bound has been shown in [31]. We improve this result by showing that weak bisimilarity of BPP is \Pi p 2 hard. Finally, we show that the problems if a BPP is regular (i.e., finite) w.r.t. strong and weak bisimilarity are coNPhard and \Pi p 2 hard, respectively.
Bisimilarity of Pushdown Automata is nonelementary
"... Given two pushdown automata, the bisimilarity problem asks whether the infinite transition systems they induce are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, improving EXPTIMEhardness, which was the best previously known lower bound for t ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Given two pushdown automata, the bisimilarity problem asks whether the infinite transition systems they induce are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, improving EXPTIMEhardness, which was the best previously known lower bound for this problem. Our lower bound result holds for normed pushdown automata as well.
Weak Bisimilarity and Regularity of BPA is EXPTIMEhard
 In Proccedings of the 10th International Workshop on Expressiveness in Concurrency (EXPRESS’03
, 2002
"... We show that checking weak bisimulation equivalence of two contextfree processes (also called BPAprocesses) is EXPTIMEhard, even under the condition that the processes are normed. Furthermore, checking weak regularity (finiteness up to weak bisimilarity) for contextfree processes is EXPTIMEhard a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We show that checking weak bisimulation equivalence of two contextfree processes (also called BPAprocesses) is EXPTIMEhard, even under the condition that the processes are normed. Furthermore, checking weak regularity (finiteness up to weak bisimilarity) for contextfree processes is EXPTIMEhard as well.