Pages that link to "Item:Q672326"
From MaRDI portal
The following pages link to Undecidability of bisimilarity for Petri nets and some related problems (Q672326):
Displaying 39 items.
- Undecidability of accordance for open systems with unbounded message queues (Q402353) (← links)
- Parametrized automata simulation and application to service composition (Q485834) (← links)
- Undecidability of performance equivalence of Petri nets (Q507373) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- Deciding bisimulation and trace equivalences for systems with many identical processes (Q672063) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Resource bisimulation in Petri nets (Q880715) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- A theory of structural stationarity in the \(\pi\)-calculus (Q1014276) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves (Q2117014) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Verifying chemical reaction network implementations: a bisimulation approach (Q2422008) (← links)
- Recursive Petri nets (Q2464034) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Trace inclusion for one-counter nets revisited (Q2636512) (← links)
- Complexity hierarchies beyond elementary (Q2828216) (← links)
- Completeness results for undecidable bisimilarity problems (Q2847411) (← links)
- Encoding Asynchronous Interactions Using Open Petri Nets (Q3184668) (← links)
- Trace Inclusion for One-Counter Nets Revisited (Q3447702) (← links)
- Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems (Q3449627) (← links)
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
- On Model Checking Boolean BI (Q3644756) (← links)
- Bisimulation equivalence is decidable for one-counter processes (Q4571985) (← links)
- On the decidability of fragments of the asynchronous π-calculus (Q4917084) (← links)
- Resource Bisimilarity in Petri Nets is Decidable (Q5038572) (← links)
- Interleaving vs True Concurrency: Some Instructive Security Examples (Q5100754) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Nonprimitive recursive complexity and undecidability for Petri net equivalences (Q5941099) (← links)
- Decidability of model checking with the temporal logic EF (Q5941100) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
- Basic process algebra with deadlocking states (Q5958771) (← links)
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets (Q6137873) (← links)
- Weak bisimulation and model checking for basic parallel processes (Q6567759) (← links)
- On decidability of the bisimilarity on higher-order processes with parameterization (Q6643749) (← links)