Pages that link to "Item:Q2639636"

The following pages link to Concurrent bisimulations in Petri nets (Q2639636):

Displaying 45 items.

• History-preserving bisimilarity for higher-dimensional automata via open maps (Q265804) (← links)
• Reduction of event structures under history preserving bisimulation (Q338613) (← links)
• Symmetries, local names and dynamic (de)-allocation of names (Q618165) (← links)
• Bisimulation and action refinement (Q685407) (← links)
• Failures semantics based on interval semiwords is a congruence for refinement (Q757073) (← links)
• Configuration structures, event structures and Petri nets (Q843106) (← links)
• A reduced maximality labeled transition system generation for recursive Petri nets (Q903505) (← links)
• Maximality preserving bisimulation (Q1193655) (← links)
• Deciding true concurrency equivalences on safe, finite nets (Q1365677) (← links)
• Towards a unified view of bisimulation: A comparative study (Q1575240) (← links)
• Interleaving isotactics -- an equivalence notion on behaviour abstractions (Q1643139) (← links)
• A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
• Pomset bisimulation and unfolding for reset Petri nets (Q2113378) (← links)
• Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves (Q2117014) (← links)
• Behavioural logics for configuration structures (Q2123053) (← links)
• Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
• Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
• Verification of finite-state machines: a distributed approach (Q2413026) (← links)
• On the expressiveness of higher dimensional automata (Q2491631) (← links)
• Petri net reactive modules (Q2503287) (← links)
• Adhesive DPO parallelism for monic matches (Q2867888) (← links)
• Local Model Checking in a Logic for True Concurrency (Q2988383) (← links)
• Separability in Conflict-Free Petri Nets (Q3401931) (← links)
• Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP (Q3449628) (← links)
• Concurrency, Synchronization, and Conflicts in Petri Nets (Q3602798) (← links)
• New Bisimulation Semantics for Distributed Systems (Q3614847) (← links)
• Normalization of place/transition-systems preserves net behaviour (Q3991291) (← links)
• Step bisimulation is pomset equivalence on a parallel language without explicit internal choice (Q4279248) (← links)
• (Q4461752) (← links)
• Simultaneous Petri Net Synthesis (Q4621223) (← links)
• Deciding true concurrency equivalences on finite safe nets (preliminary report) (Q4630288) (← links)
• Non sequential semantics for contextual P/T nets (Q4633159) (← links)
• The limit of splitn-language equivalence (Q4645217) (← links)
• Minimal transition systems for history-preserving bisimulation (Q5048942) (← links)
• Interleaving vs True Concurrency: Some Instructive Security Examples (Q5100754) (← links)
• A Study on Team Bisimulations for BPP Nets (Q5100755) (← links)
• Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
• The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems (Q5166766) (← links)
• Neighbourhood Contingency Bisimulation (Q5224490) (← links)
• (Q5309393) (← links)
• A Logic for True Concurrency (Q5501929) (← links)
• A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus (Q5738986) (← links)
• (Q5875388) (← links)
• Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets (Q6137873) (← links)
• Improved implementations via a new structural equivalence on labeled nets (Q6487372) (← links)