Results 1  10
of
7,379
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
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 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
Verification of Infinitestate Systems
, 2000
"... ion by Syntactic Program Transformations 9 8 Unfoldings of Innite State Systems 9 9 Provability in a Logic for Concurrent Objects is Wellstructured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over onecounter processes 12 12 Deciding rstorder nonregular ..."
Abstract
 Add to MetaCart
ion by Syntactic Program Transformations 9 8 Unfoldings of Innite State Systems 9 9 Provability in a Logic for Concurrent Objects is Wellstructured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over onecounter processes 12 12 Deciding rstorder non
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
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
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
) 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
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
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
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
Results 1  10
of
7,379