Pages that link to "Item:Q1365677"

The following pages link to Deciding true concurrency equivalences on safe, finite nets (Q1365677):

Displaying 14 items.

• Hardness of preorder checking for basic formalisms (Q650916) (← links)
• The decidability border of hereditary history preserving bisimilarity (Q835053) (← links)
• Non-interleaving bisimulation equivalences on basic parallel processes (Q1049404) (← links)
• The complexity of PDL with interleaving (Q1351943) (← links)
• Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
• Discrete time stochastic and deterministic Petri box calculus dtsdPBC (Q2212703) (← links)
• A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
• Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC (Q2633503) (← links)
• Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems (Q3449627) (← links)
• Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
• Minimal transition systems for history-preserving bisimulation (Q5048942) (← links)
• (Q5111642) (← links)
• Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition (Q5166610) (← links)
• Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets (Q6137873) (← links)