Results 1  10
of
75
Petri Nets and Bisimulations
 THEORETICAL COMPUTER SCIENCE
, 1995
"... Several categorical relationships (adjunctions) between models for concurrency have been established, allowing the translation of concepts and properties from one model to another. A central example is a coreflection between Petri nets and asynchronous transition systems. The purpose of the pres ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
of the present paper is to illustrate the use of such relationships by transferring to Petri nets a general concept of bisimulation.
Bisimulation and the reduction of Petri nets
 Proceedings of the 21st International Conference on Applications and Theory of Petri Nets (ICATPN 2000), volume 1825 of Lecture Notes in Computer Science
, 2000
"... . We investigate structural equivalences on places of P/T nets that allow reductions compatible with bisimilarity. This comes with a study of two kinds of reductions: fusion of equivalent places, and replacement of some places by other ones. When effectivity issues are considered, we are lead to ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
, and it relates equivalent places rather than equivalent markings. While several early papers adapted Milner's concept of bisimilarity to the transition systems generated by Petri nets [NT84,Pom86], Olderog was the first to propose a notion of bisimulation that comes from lifting a bisimulation between
Bisimulation from Open Maps
 INFORMATION AND COMPUTATION
, 1994
"... An abstract definition of bisimulation is presented. It enables a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction f ..."
Abstract

Cited by 143 (43 self)
 Add to MetaCart
from Petri nets) and labelled event structures are considered. On transition systems the abstract definition readily specialises to Milner's strong bisimulation. On event structures it explains and leads to a revision of historypreserving bisimulation of Rabinovitch and Traktenbrot, Goltz
Deciding finiteness of Petri nets up to bisimulation
, 1996
"... We study the following problems for strong and weak bisimulation equivalence: given a labelled Petri net and a finite transition system, are they equivalent?; given a labelled Petri net, is it equivalent to some (unspecified) finite transition system? We show that both problems are decidable for st ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We study the following problems for strong and weak bisimulation equivalence: given a labelled Petri net and a finite transition system, are they equivalent?; given a labelled Petri net, is it equivalent to some (unspecified) finite transition system? We show that both problems are decidable
Saturation Heuristic for Faster Bisimulation with Petri Nets
, 2009
"... Bisimilarity is an extensional notion of equivalence of states of an automata. A bisimulation is a set of such equivalences among the states of automata. The bisimulation problem is the task of deciding bisimilarity for all pairs of states of an automata. The present work applies the Saturation [15] ..."
Abstract
 Add to MetaCart
with deterministic transition relations (Petri Nets) we show that bisimulation can be expressed as a statespace exploration problem. This suggests the use of the saturation[3] heuristic, which has been found to be relatively efficient for statespace generation. The present work explores the use of our novel
Place bisimulations for the reduction of labeled Petri nets with silent moves
, 1994
"... Place bisimulations are equivalences between places of Petri nets. They can be used to fuse bisimilar places in a net: this gives a smaller net with identical behaviour. In this paper, we extend the basic theory (from [ABS91, AS92]) to labeled nets with silent (invisible) transitions. We describe a ..."
Abstract
 Add to MetaCart
Place bisimulations are equivalences between places of Petri nets. They can be used to fuse bisimilar places in a net: this gives a smaller net with identical behaviour. In this paper, we extend the basic theory (from [ABS91, AS92]) to labeled nets with silent (invisible) transitions. We describe a
Petri Nets and Regular Processes
 Computing Science Department, Uppsala University
, 1999
"... We consider the following problems: (a) Given a labelled Petri net and a finite automaton, are they equivalent? (b) Given a labelled Petri net, is it equivalent to some (unspecified) finite automaton? These questions are studied within the framework of trace and bisimulation equivalences, in both th ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We consider the following problems: (a) Given a labelled Petri net and a finite automaton, are they equivalent? (b) Given a labelled Petri net, is it equivalent to some (unspecified) finite automaton? These questions are studied within the framework of trace and bisimulation equivalences, in both
Bisimulation and Open Maps
 In Proc. LICS'93, Eighth Annual Symposium on Logic in Computer Science
, 1993
"... An abstract definition of bisimulation is presented. It enables a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction from ..."
Abstract

Cited by 41 (7 self)
 Add to MetaCart
Petri nets) and labelled event structures are considered. On transition systems the abstract definition readily specialises to Milner's strong bisimulation. On event structures it explains and leads to a revision of historypreserving bisimulation of Rabinovitch and Traktenbrot, Goltz and van
Characterizing behavioural congruences for Petri nets
 Proc. CONCUR’95, LNCS 962
, 1995
"... Abstract. We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising from four simple notions of behaviour, viz., traces, maximal traces, step, and maximal step traces, and from the corresp ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
Abstract. We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising from four simple notions of behaviour, viz., traces, maximal traces, step, and maximal step traces, and from
An Extensional Formulation of ST Bisimulation
"... In this paper we characterize in an alternative, extensional way the non atomic equivalence based on the notion of ST bisimulation. This equivalence, originally proposed in [10] over Petri Nets, states that actions can be observed in the middle of their evolution and, additionally, that the individu ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we characterize in an alternative, extensional way the non atomic equivalence based on the notion of ST bisimulation. This equivalence, originally proposed in [10] over Petri Nets, states that actions can be observed in the middle of their evolution and, additionally
Results 1  10
of
75