Results 11  20
of
75
On an Abstract Characterization of Bisimulation
 Department of Informatics. University of Oslo
, 1997
"... [AM89] and [JNW94] present abstract concepts of bisimulation in terms of category theory. This paper deals with the question how to relate these approaches. Futheron it shows how different types of bisimulations on event structures can be modelled in terms of the abstract concepts. Bisimulation ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
was introduced by [Mil80] and [Par81] in order to identify processes that cannot be distinguished by an external agent. Since then various notions of "bisimulation" have been studied, e.g. on labelled transition systems by [DNMV90], [MS92], on event structures by [GG89], [GKP92], on petri nets by [GV87
Undecidability of Bisimilarity for Petri Nets and Some Related Problems
, 1995
"... The main result shows the undecidability of (strong) bisimilarity for labelled (place / transition) Petri nets. The technique of the proof applies to the language (or trace) equivalence and the reachability set equality as well, which yields stronger versions with simpler proofs of already known ..."
Abstract

Cited by 58 (3 self)
 Add to MetaCart
results. The paper also contains two decidability results. One concerns the Petri nets which are deterministic up to bisimilarity, the other concerns semilinear bisimulations and extends the result of [4] for Basic Parallel Processes. 1 Introduction The topic of the paper belongs to an interesting
Undecidability of performance equivalence of Petri nets
"... We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable (which is the case, e.g., over communicationfree nets). We disprove this con ..."
Abstract
 Add to MetaCart
We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable (which is the case, e.g., over communicationfree nets). We disprove
Maximality Semantics and Petri Nets 1
"... Maximalitybased labeled transition system model is a model which expresses, in a natural way, maximality semantics of concurrent systems. In this paper, we present intuitively and motivate the maximality semantics. Moreover, we present some results around expressing trueconcurrent semantics of P/T ..."
Abstract
 Add to MetaCart
/T Petri nets in terms of maximalitybased labeled transition systems. First, an operational semantics for P/T Petri nets allowing interpreting a Petri net in terms of maximalitybased labeled transition system is proposed. As effect, bisimulation relations of maximality, defined on maximality
Bisimulation Congruences in the Calculus of Looping Sequences
 Int. Colloquium on Theoretical Aspects of Computing (ICTAC’06), LNCS 4281
, 2006
"... Abstract. The Calculus of Looping Sequences (CLS) is a calculus suitable to describe biological systems and their evolution. CLS terms are constructed by starting from basic constituents and composing them by means of operators of concatenation, looping, containment and parallel composition. CLS ter ..."
Abstract

Cited by 17 (15 self)
 Add to MetaCart
of a biological system and we use bisimulations to reason about properties of the described system. 1 Introduction In the last few years many formalisms originally developed by computer scientiststo model systems of interacting components have been applied to Biology. Among these, there are Petri Nets
Weak Bisimulation and Model Checking for Basic Parallel Processes
 IN FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FST&TCS'96), VOLUME 1180 OF LNCS
, 1996
"... Basic Parallel Processes (BPP) are a natural subclass of CCS infinitestate processes. They are also equivalent to a special class of Petri nets. We show that unlike for general Petri nets, it is decidable if a BPP and a finitestate system are weakly bisimilar. To the best of our knowledge, this i ..."
Abstract

Cited by 17 (9 self)
 Add to MetaCart
Basic Parallel Processes (BPP) are a natural subclass of CCS infinitestate processes. They are also equivalent to a special class of Petri nets. We show that unlike for general Petri nets, it is decidable if a BPP and a finitestate system are weakly bisimilar. To the best of our knowledge
A Fully Symbolic Bisimulation Algorithm
"... Abstract. We apply the saturation heuristic to the bisimulation problem for deterministic discreteevent models, obtaining the fastest to date symbolic bisimulation algorithm, able to deal with large quotient spaces. We compare performance of our algorithm with that of Wimmer et al., on a collection ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of classes that could be processed before succumbing to statespace explosion. We conclude that it may be possible to solve the bisimulation problem for systems having only visible deterministic transitions (e.g., Petri nets where each transition has a distinct label) even if the quotient space is large (e
Semantic Reachability for Simple Process Algebras
 University of Passau. University of Passau
, 1996
"... This paper is an approach to combine the reachability problem with semantic notions like bisimulation equivalence. It deals with questions of the following form: Is a state reachable that is bisimulation equivalent to a given state ? Here we show some decidability results for process algebras and Pe ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
and Petri nets. Keywords: bisimulation, reachability problem, process algebras, Petri nets 1 Introduction The reachability problem plays an important role in the theory of concurrent systems. The question is if a given state is reachable from the initial state by a sequence of actions. The complexity
Algorithm of Translation of MSCspecified System into Petri Net
"... Abstract. We present in this paper the algorithm which performs the translation of MSC’2000 diagrams into Petri net modulo strong bisimulation. The correctness of this algorithm is justified. Here we supplement MSC’2000 standard supplying it with formal definition of MSC element <condition> by ..."
Abstract
 Add to MetaCart
Abstract. We present in this paper the algorithm which performs the translation of MSC’2000 diagrams into Petri net modulo strong bisimulation. The correctness of this algorithm is justified. Here we supplement MSC’2000 standard supplying it with formal definition of MSC element <
rEquivalences and Refinement for Petri Net Based Design
, 2000
"... The paper is devoted to the investigation of behavioral equivalences of concurrent systems modeled by Petri nets with silent transitions. Basic equivalences and backforth bisimulation equivalences known from the literature are supplemented by new ones, giving rise to complete set of equivalence n ..."
Abstract
 Add to MetaCart
The paper is devoted to the investigation of behavioral equivalences of concurrent systems modeled by Petri nets with silent transitions. Basic equivalences and backforth bisimulation equivalences known from the literature are supplemented by new ones, giving rise to complete set of equivalence
Results 11  20
of
75