Process rewrite systems.
From MaRDI portal
Publication:1854328
DOI10.1006/inco.1999.2826zbMath1046.68566OpenAlexW2006265470MaRDI QIDQ1854328
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/98579b5e60ba8f3372a6ac7102680733d885324b
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items
Resource Bisimilarity in Petri Nets is Decidable, A Characterization of Distributed ASMs with Partial-Order Runs, Unnamed Item, Bisimulation equivalence and regularity for real-time one-counter automata, Language Representability of Finite P/T Nets, Decidability issues for extended ping-pong protocols, Dynamic Recursive Petri Nets, Theory of interaction, Simulation relations and applications in formal methods, The complexity of bisimilarity-checking for one-counter processes., An algebra of behavioural types, On Probabilistic Parallel Programs with Process Creation and Synchronisation, Reachability analysis of fragments of mobile ambients in AC term rewriting, Recursive Petri nets, Verification of well-formed communicating recursive state machines, Unnamed Item, Complexity of Weak Bisimilarity and Regularity for BPA and BPP, An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems, Partially-commutative context-free processes: expressibility and tractability, Petri nets are less expressive than state-extended PA, Weak bisimilarity and regularity of context-free processes is EXPTIME-hard, On the computational complexity of bisimulation, redux, Deciding Reachability in Mobile Ambients with Name Restriction, On Decidability of LTL+Past Model Checking for Process Rewrite Systems, Decidability of model checking with the temporal logic EF, Deciding bisimulation-like equivalences with finite-state processes, Model checking for process rewrite systems and a class of action-based regular properties, Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time, Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, On decidability of LTL model checking for process rewrite systems, Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, Unnamed Item, The Decidability of the Reachability Problem for CCS!, Reachability is decidable for weakly extended process rewrite systems, Bisimilarity on basic parallel processes, A Behavioural Theory of Recursive Algorithms, Non-interleaving bisimulation equivalences on basic parallel processes, Decidable first-order transition logics for PA-processes, Simulation preorder over simple process algebras, On Symbolic Verification of Weakly Extended PAD, Automated formal analysis and verification: an overview, Dynamic connectors for concurrency, Model checking dynamic pushdown networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the regular structure of prefix rewriting
- Decidability of a temporal logic problem for Petri nets
- Algebra of communicating processes with abstraction
- Decidability of model checking for infinite-state concurrent systems
- An Algorithm for the General Petri Net Reachability Problem
- Reachability analysis of pushdown automata: Application to model-checking
- Model checking PA-processes
- Infinite results
- Bisimulation collapse and the process taxonomy
- Constrained properties, semilinear systems, and Petri nets
