Process rewrite systems.
type: Item
instance of: scholarly article
title: Process rewrite systems.
zbMATH Open document ID: 1046.68566
author: Richard M. Mayr
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1853087
zbMATH Keywords: PA-processes
zbMATH Keywords: pushdown processes
zbMATH Keywords: Petri nets
MaRDI profile type: Publication
OpenAlex ID: W2006265470
cites work: Bisimulation collapse and the process taxonomy
cites work: Q4355677
cites work: Reachability analysis of pushdown automata: Application to model-checking
cites work: Constrained properties, semilinear systems, and Petri nets
cites work: Algebra of communicating processes with abstraction
cites work: On the regular structure of prefix rewriting
cites work: Decidability of model checking for infinite-state concurrent systems
cites work: Q5592246
cites work: Decidability of a temporal logic problem for Petri nets
cites work: An Algorithm for the General Petri Net Reachability Problem
cites work: Q4364400
cites work: Model checking PA-processes
cites work: Q4222920
cites work: Q4234763
cites work: Q3992568
cites work: Infinite results
DOI: 10.1006/INCO.1999.2826
description: scientific article; zbMATH DE number 1853087