Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/18967
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBaldan, P.-
dc.contributor.authorCorradini, A.-
dc.contributor.authorEhrig, H.-
dc.contributor.authorHeckel, Reiko-
dc.contributor.authorKoenig, B.-
dc.date.accessioned2012-10-24T09:06:10Z-
dc.date.available2012-10-24T09:06:10Z-
dc.date.issued2008-20-21-
dc.identifier.citationLogical Methods in Computer Science, 2008, 4 (4)-
dc.identifier.issn1860-5974-
dc.identifier.urihttp://hdl.handle.net/2381/18967-
dc.identifier.urihttp://www.lmcs-online.org/ojs/viewarticle.php?id=384-
dc.description1998 ACM Subject Classification: F.3.1, F.4.2.-
dc.description.abstractWe 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.-
dc.description.sponsorshipResearch partially supported by the EU IST-2004-16004 SEnSOria, the MIUR Project ART, the DFG project SANDS, the DFG project Behaviour-GT and CRUI/DAAD Vigoni “Models based on Graph Transformation Systems: Analysis and Verification”.-
dc.language.isoEnglish-
dc.publisherIfCoLog (International Federation of Computational Logic)-
dc.rightsCreative Commons Attribution-NoDerivs 2.0 Generic (CC BY-ND 2.0)-
dc.sourceWeb of Science-
dc.source.urihttp://webofknowledge.com-
dc.subjectScience & Technology-
dc.subjectTechnology-
dc.subjectComputer Science-
dc.subjectTheory & Methods-
dc.subjectLogic-
dc.subjectComputer Science-
dc.subjectScience & Technology - Other Topics-
dc.subjectOpen systems-
dc.subjectPetri nets-
dc.subjectbisimilarity-
dc.subjectcompositionality-
dc.subjectreconfiguration-
dc.subjectbehaviour preserving transformations-
dc.subjectPARTIAL-ORDER SEMANTICS-
dc.subjectREFINEMENT-
dc.titleBisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets-
dc.typeJournal Article-
dc.identifier.doi10.2168/LMCS-4(4:3)2008-
dc.description.irispid43934-
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
0809.4115.pdfPublisher Version881.83 kBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.