The following pages link to Process rewrite systems. (Q1854328):
Displaying 42 items.
- An algebra of behavioural types (Q418153) (← links)
- Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- Theory of interaction (Q896903) (← links)
- Reachability analysis of fragments of mobile ambients in AC term rewriting (Q939167) (← links)
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- On decidability of LTL model checking for process rewrite systems (Q1006890) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Non-interleaving bisimulation equivalences on basic parallel processes (Q1049404) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- Simulation preorder over simple process algebras (Q1854513) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- Model checking dynamic pushdown networks (Q2355386) (← links)
- Recursive Petri nets (Q2464034) (← links)
- Petri nets are less expressive than state-extended PA (Q2481981) (← links)
- Model checking for process rewrite systems and a class of action-based regular properties (Q2503332) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- (Q2842873) (← links)
- On Symbolic Verification of Weakly Extended PAD (Q2866343) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- On Probabilistic Parallel Programs with Process Creation and Synchronisation (Q3000662) (← links)
- The Decidability of the Reachability Problem for CCS! (Q3090842) (← links)
- Language Representability of Finite P/T Nets (Q3460873) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
- An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems (Q4917080) (← links)
- A Behavioural Theory of Recursive Algorithms (Q4988914) (← links)
- Resource Bisimilarity in Petri Nets is Decidable (Q5038572) (← links)
- A Characterization of Distributed ASMs with Partial-Order Runs (Q5040367) (← links)
- Dynamic Recursive Petri Nets (Q5100760) (← links)
- (Q5111633) (← links)
- Deciding Reachability in Mobile Ambients with Name Restriction (Q5179047) (← links)
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems (Q5179053) (← links)
- (Q5207052) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5892174) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5894255) (← links)
- Decidability of model checking with the temporal logic EF (Q5941100) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
