Results 1  10
of
957,587
Bisimulation Equivalence is Decidable 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, in fact. Also regularity, i.e. bisimulation equivalence with some finitestate process, is shown to be decidable for the mentioned p ..."
Abstract
 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, in fact. Also regularity, i.e. bisimulation equivalence with some finitestate process, is shown to be decidable for the mentioned
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.
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
the decidability of various problems, specifically testing regularity and strong regularity of onecounter nets with respect to simulation equivalence, and testing simulation equivalence between a onecounter net and a deterministic pushdown automaton. Various obvious generalisations of these problems
Bisimulation through probabilistic testing
 in “Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL
, 1989
"... We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily clos ..."
Abstract

Cited by 530 (14 self)
 Add to MetaCart
close to one, between processes that are not bisimulation equivalent. We also show a similar result (in a slightly stronger form) for a new process relation called $bisimulationwhich lies strictly between that of simulation and bisimulation. Finally, the ultimately strength of the testing language
Simulation is Decidable for Onecounter Nets (Extended Abstract)
 In Proceedings of CONCUR'98, Lecture Notes in Computer Science 1466:253268
, 1998
"... ) Parosh Aziz Abdulla Dept. of Computer Systems P.O. Box 325 S751 05 Uppsala, Sweden parosh@docs.uu.se Karlis Cerans Institute of Mathematics and Computer Science University of Latvia karlis@cclu.lv Abstract We prove that the simulation preorder is decidable for the class of onecounter nets. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
of onecounter nets is computationally equivalent to the class of Petri nets with one unbounded place, and to the class of pushdown automata where the stack alphabet is restricted to one symbol. To our knowledge, this is the first result in the literature which gives a positive answer to the decidability
Simulation problems for onecounter machines
 In Proceedings of SOFSEM’99, volume 1725 of LNCS
, 1999
"... Abstract. We consider decidability questions for simulation preorder (andequivalence) for processes generated by onecounter machines. We sketch a proof of decidability in the case when testing for zero is not possible, and demonstratethe undecidability in the general case. 1 Introduction A onecoun ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
Abstract. We consider decidability questions for simulation preorder (andequivalence) for processes generated by onecounter machines. We sketch a proof of decidability in the case when testing for zero is not possible, and demonstratethe undecidability in the general case. 1 Introduction A onecounter
Simulation Problems for OneCounter Machines
, 1999
"... . We consider decidability questions for simulation preorder (and equivalence) for processes generated by onecounter machines. We sketch a proof of decidability in the case when testing for zero is not possible, and demonstrate the undecidability in the general case. 1 Introduction A onecounter m ..."
Abstract
 Add to MetaCart
. We consider decidability questions for simulation preorder (and equivalence) for processes generated by onecounter machines. We sketch a proof of decidability in the case when testing for zero is not possible, and demonstrate the undecidability in the general case. 1 Introduction A onecounter
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
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
Branching Time and Abstraction in Bisimulation Semantics
 Journal of the ACM
, 1996
"... Abstract. In comparative concurrency semantics, one usually distinguishes between linear time and branching time semantic equivalences. Milner’s notion of ohsen~ation equirlalence is often mentioned as the standard example of a branching time equivalence. In this paper we investigate whether observa ..."
Abstract

Cited by 322 (17 self)
 Add to MetaCart
ranges over all actions) and the usual laws for strong congruence. WC also establish that for sequential processes observation equivalence is not preserved under refinement of actions, whereas branching bisimulation is. For a large class of processes, it turns out that branching bisimulation
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
particular, it means that the problem is both NP and coNP hard). The same technique is used to demonstrate coNPhardness of strong bisimilarity between processes of onecounter nets. Then we design an algorithm which decides weak bisimilarity between processes of onecounter automata and finite
Results 1  10
of
957,587