Reachability is decidable for weakly extended process rewrite systems
From MaRDI portal
Publication:1023281
DOI10.1016/j.ic.2009.01.003zbMath1167.68029OpenAlexW1993478572MaRDI QIDQ1023281
Mojmír Křetínský, Jan Strejček, Vojtěch Řehák
Publication date: 11 June 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.01.003
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Undecidability of bisimilarity for Petri nets and some related problems
- On the regular structure of prefix rewriting
- Decidability issues for extended ping-pong protocols
- On decidability of LTL model checking for process rewrite systems
- Alternating automata, the weak monadic theory of trees and its complexity
- Process rewrite systems.
- Petri nets and regular processes
- On the security of public key protocols
- Rewrite Systems with Constraints
- High undecidability of weak bisimilarity for Petri nets
- Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- CONCUR 2004 - Concurrency Theory
- Regular canonical systems
- A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
- SOFSEM 2005: Theory and Practice of Computer Science
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Pushdown automata, multiset automata, and Petri nets
- Deciding bisimulation-like equivalences with finite-state processes
- Infinite results
This page was built for publication: Reachability is decidable for weakly extended process rewrite systems
