On computing reachability sets of process rewrite systems

DOI10.1007/978-3-540-32033-3_35MaRDI QIDQ5703871zbMATH OpenOpenAlexFDO

Authors Ahmed Bouajjani, Tayssir Touili

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b135673

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Constrained Reachability of Process Rewrite Systems
• Process rewrite systems.
• Extended process rewrite systems: Expressiveness and reachability
• scientific article; zbMATH DE number 1231599

Cited in

(22)

• On decidability of LTL model checking for process rewrite systems
• Process rewrite systems.
• Verifying parallel programs with dynamic communication structures
• One-variable context-free hedge automata
• Reachability analysis of synchronized PA systems
• On symbolic verification of weakly extended PAD
• A Completion Method to Decide Reachability in Rewrite Systems
• scientific article; zbMATH DE number 1809624 (Why is no real title available?)
• Constrained Reachability of Process Rewrite Systems
• When Is Reachability Intrinsically Decidable?
• On the Reachability Analysis of Acyclic Networks of Pushdown Systems
• Rigid Tree Automata
• Verifying Parallel Programs with Dynamic Communication Structures
• An automata-theoretic approach to the reachability analysis of RPPS systems
• Bounded communication reachability analysis of process rewrite systems with ordered parallelism
• Verifying multithreaded recursive programs with integer variables
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Extended process rewrite systems: Expressiveness and reachability
• On Decidability of LTL Model Checking for Process Rewrite Systems
• Rigid tree automata and applications
• Equational approximations for tree automata completion
• A note on partially ordered tree automata

Describes a project that uses

Uses Software

• TREX

This page was built for publication: On computing reachability sets of process rewrite systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703871)