Deciding true concurrency equivalences on safe, finite nets
type: Item
instance of: scholarly article
title: Deciding true concurrency equivalences on safe, finite nets
zbMATH Open document ID: 0877.68056
DOI: 10.1016/0304-3975(95)00132-8
author: Lalita Jategaonkar
author: Albert R. Meyer
published in: Theoretical Computer Science
publication date: 1997-09-09T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1058318
zbMATH Keywords: computational complexity
zbMATH Keywords: Petri nets
zbMATH Keywords: EXPSPACE
zbMATH Keywords: DEXPTIME
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00132-8
OpenAlex ID: W2003972637
cites work: Concurrent bisimulations in Petri nets
cites work: Q4721639
cites work: A Theory of Communicating Sequential Processes
cites work: Q3680258
cites work: Maximality preserving bisimulation
cites work: Q4038723
cites work: Q3997501
cites work: Q5592246
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: Q3992568
cites work: Q3751025
cites work: Checking equivalences between concurrent systems of finite agents (Extended abstract)
cites work: Q3805922
cites work: Step failures semantics and a complete proof system
cites work: Q3975146
cites work: Q3771632
cites work: Bisimulation and action refinement
cites work: Q4036588
cites work: Failures semantics based on interval semiwords is a congruence for refinement
cites work: Generalized OM-bisimulation
description: scientific article; zbMATH DE number 1058318