scientific article; zbMATH DE number 7438571
From MaRDI portal
Publication:5013881
zbMath1476.68128MaRDI QIDQ5013881
Rupak Majumdar, Rayna Dimitrova
Publication date: 3 December 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2015.8
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of decision problems for finite-turn multicounter machines
- A Perfect Model for Bounded Verification
- Explicit State Model Checking for Graph Grammars
- A Temporal Graph Logic for Verification of Graph Transformation Systems
- Two-Way Counter Machines and Diophantine Equations
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Handbook of Graph Grammars and Computing by Graph Transformation
- On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
- CONCUR 2004 - Concurrency Theory
- The tree width of auxiliary storage
- Automata with Reversal-Bounded Counters: A Survey
- From Löwenheim to PSL and SVA
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication:
