scientific article; zbMATH DE number 1754582
From MaRDI portal
Publication:4535007
Recommendations
- scientific article; zbMATH DE number 3982543
- Publication:4939270
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Infinitary rewriting: foundations revisited
- Recognizable and logically definable languages of infinite computations in concurrent automata
- scientific article; zbMATH DE number 1722708
- scientific article; zbMATH DE number 3158402
- Computer Science Logic
- scientific article; zbMATH DE number 3254898
Cited in
(12)- Verification of infinite-state systems with applications to security. Proceedings of the NATO Advanced Research Workshop on verification of infinite-state systems with applications to security, Timaşoara, Romania, March 17--22, 2005
- Automated Technology for Verification and Analysis
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
- Taming the infinite: Verification of infinite-state reactive systems by finitary means
- Invariants and closures in the theory of rewrite systems
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Iterating transducers
- Generalized rewrite theories, coherence completion, and symbolic methods
- A general approach to comparing infinite-state systems with their finite-state specifications
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
- Rewriting systems over nested data words
- scientific article; zbMATH DE number 3982543 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535007)
