A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets
type: Item
instance of: scholarly article
title: A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets
zbMATH Open document ID: 0930.68093
DOI: 10.1016/S0304-3975(98)00351-X
author: Catherine Dufourd
author: Alain Finkel
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1387442
zbMATH Keywords: concurrency
zbMATH Keywords: verification
zbMATH Keywords: Petri nets
zbMATH Keywords: equivalences
MaRDI profile type: Publication
cites work: Some decision problems related to the reachability problem for Petri nets
cites work: Q4219024
cites work: Q4289279
cites work: Homomorphisms between models of parallel computation
cites work: Normalization of place/transition-systems preserves net behaviour
cites work: Q3911403
cites work: Branching time and abstraction in bisimulation semantics
full work available at URL: s0304-3975(98)00351-x
OpenAlex ID: W1980791422
description: scientific article; zbMATH DE number 1387442