Rewriting semantics of production rule sets
type: Item
instance of: scholarly article
title: Rewriting semantics of production rule sets
zbMATH Open document ID: 1279.68188
author: Michael Katelman
author: Sean Keller
author: José Meseguer
published in: The Journal of Logic and Algebraic Programming
publication date: 2013-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 6126077
zbMATH Keywords: asynchronous digital circuits
zbMATH Keywords: formal semantics
zbMATH Keywords: rewriting logic semantics
zbMATH Keywords: hazard freedom
zbMATH Keywords: deadlock freedom
zbMATH Keywords: formal verification
zbMATH Keywords: quasi-delay-insensitive circuits
describes a project that uses: Maude
describes a project that uses: PMaude
describes a project that uses: PVeStA
MaRDI profile type: Publication
full work available at URL: j.jlap.2012.06.002
OpenAlex ID: W2014213801
cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
cites work: Q4117362
cites work: Communicating sequential processes
cites work: Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuits
cites work: Compiling communicating processes into delay-insensitive VLSI circuits
cites work: Conditional rewriting logic as a unified model of concurrency
cites work: The rewriting logic semantics project
cites work: Q5514078
cites work: Hierarchical verification of asynchronous circuits using temporal logic
cites work: Q5558258
cites work: Verification of asynchronous circuits by BDD-based model checking of Petri nets
cites work: Abstract interpretation of combinational asynchronous circuits
cites work: Modular Model Checking of Large Asynchronous Designs with Efficient Abstraction Refinement
DOI: 10.1016/J.JLAP.2012.06.002
description: scientific article; zbMATH DE number 6126077