Results 1  10
of
5,374
Bisimilarity of onecounter processes is PSPACEcomplete
"... Abstract. A onecounter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic onecounter automata (with no εsteps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches ..."
Abstract
 Add to MetaCart
), and matches the known PSPACE lower bound (Srba 2009). Moreover, we prove PTIMEcompleteness of regularity of onecounter processes (i.e., their finiteness up to bisimilarity). 1
Bisimilarity of onecounter processes is PSPACEcomplete
"... A onecounter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic onecounter automata (with no εsteps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches the known ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
the known PSPACE lower bound (Srba 2009). We add the PTIMEcompleteness result for deciding regularity (i.e. finiteness up to bisimilarity) of onecounter processes.
Simulation Over Onecounter Nets is PSPACEComplete
, 2013
"... Onecounter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of onecounter automata with just a weak test for zero. Unlike many other semantic equivalences, strong and weak simulation preorder are decidable for OCN, but the computational complexity was a ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Onecounter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of onecounter automata with just a weak test for zero. Unlike many other semantic equivalences, strong and weak simulation preorder are decidable for OCN, but the computational complexity
The Complexity of BisimilarityChecking for OneCounter Processes
"... We study the problem of bisimilaritychecking between processes of onecounter automata and finitestate processes. We show that deciding weak bisimilarity between processes of onecounter nets (which are ‘restricted ’ onecounter automata where the counter cannot be tested for zero) and finitestat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the problem of bisimilaritychecking between processes of onecounter automata and finitestate processes. We show that deciding weak bisimilarity between processes of onecounter nets (which are ‘restricted ’ onecounter automata where the counter cannot be tested for zero) and finite
Everything Is PSPACEComplete in Interaction Systems
"... Abstract. We study complexity issues for interaction systems, a general model for componentbased systems that allows for a very flexible interaction mechanism. We present complexity results for important properties of interaction systems such as local/global deadlockfreedom, progress and availabil ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We study complexity issues for interaction systems, a general model for componentbased systems that allows for a very flexible interaction mechanism. We present complexity results for important properties of interaction systems such as local/global deadlockfreedom, progress and availability of components. 1
Decidability of Bisimilarity for OneCounter Processes
, 1997
"... It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter. Also finiteness up to bisimilarity is shown to be decidable for the mentioned processes. ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter. Also finiteness up to bisimilarity is shown to be decidable for the mentioned processes.
Strong Bisimilarity on Basic Parallel Processes is PSPACEcomplete
"... Abstract The paper shows an algorithm which, given a Basic ParallelProcesses (BPP) system, constructs a set of linear mappings which characterize the (strong) bisimulation equivalence onthe system. Though the number of the constructed mappings can be exponential, they can be generated in polynomials ..."
Abstract
 Add to MetaCart
in polynomialspace; this shows that the problem of deciding bisimulation equivalence on BPP is in PSPACE. Combining with thePSPACEhardness result by Srba, PSPACEcompleteness is thus established. 1. Introduction Bisimulation equivalence is a fundamental behaviouralequivalence in concurrency theory, having also
Efficient Verification Algorithms for OneCounter Processes
, 2000
"... We study the problem of strong/weak bisimilarity between processes of onecounter automata and finitestate processes. We show that the problem of weak bisimilarity between processes of onecounter nets (which are `weak' onecounter automata) and finitestate processes is DPhard (in partic ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We study the problem of strong/weak bisimilarity between processes of onecounter automata and finitestate processes. We show that the problem of weak bisimilarity between processes of onecounter nets (which are `weak' onecounter automata) and finitestate processes is DPhard (in
Simulation and Bisimulation over OneCounter Processes
, 2000
"... We show an effective construction of (a periodicity description of) the maximal simulation relation for a given onecounter net. Then we demonstrate how to reduce simulation problems over onecounter nets to analogous bisimulation problems over onecounter automata. We use this to demonstrate th ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
We show an effective construction of (a periodicity description of) the maximal simulation relation for a given onecounter net. Then we demonstrate how to reduce simulation problems over onecounter nets to analogous bisimulation problems over onecounter automata. We use this to demonstrate
BranchingTime Model Checking of Parametric OneCounter Automata
"... Abstract. We study the computational complexity of model checking EF logic and modal logic on parametric onecounter automata (POCA). A POCA is a onecounter automaton whose counter updates are either integer values encoded in binary or integervalued parameters. Given a formula and a configuration o ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Abstract. We study the computational complexity of model checking EF logic and modal logic on parametric onecounter automata (POCA). A POCA is a onecounter automaton whose counter updates are either integer values encoded in binary or integervalued parameters. Given a formula and a configuration
Results 1  10
of
5,374