Computer Science – Logic in Computer Science
Scientific paper
2008-09-24
LMCS 4 (4:3) 2008
Computer Science
Logic in Computer Science
To appear in "Logical Methods in Computer Science", 41 pages
Scientific paper
10.2168/LMCS-4(4:3)2008
We propose a framework for the specification of behaviour-preserving reconfigurations of systems modelled as Petri nets. The framework is based on open nets, a mild generalisation of ordinary Place/Transition nets suited to model open systems which might interact with the surrounding environment and endowed with a colimit-based composition operation. We show that natural notions of bisimilarity over open nets are congruences with respect to the composition operation. The considered behavioural equivalences differ for the choice of the observations, which can be single firings or parallel steps. Additionally, we consider weak forms of such equivalences, arising in the presence of unobservable actions. We also provide an up-to technique for facilitating bisimilarity proofs. The theory is used to identify suitable classes of reconfiguration rules (in the double-pushout approach to rewriting) whose application preserves the observational semantics of the net.
Baldan Paolo
Corradini Andrea
Ehrig Hartmut
Heckel Reiko
König Barbara
No associations
LandOfFree
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-110716