The following pages link to (Q3975146):
Displaying 50 items.
- History-preserving bisimilarity for higher-dimensional automata via open maps (Q265804) (← links)
- On the expressive power of behavioral profiles (Q315288) (← links)
- Reduction of event structures under history preserving bisimulation (Q338613) (← links)
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← links)
- Models for name-passing processes: Interleaving and causal (Q598191) (← links)
- Petri nets and bisimulation (Q672873) (← links)
- A theory of processes with durational actions (Q674005) (← links)
- Bisimulation and action refinement (Q685407) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- Refinement of actions in event structures and causal trees (Q688717) (← links)
- Failures semantics based on interval semiwords is a congruence for refinement (Q757073) (← links)
- A theory of system behaviour in the presence of node and link failure (Q939442) (← links)
- Non-interleaving bisimulation equivalences on basic parallel processes (Q1049404) (← links)
- \(\tau\)-bisimulations and full abstraction for refinement of actions (Q1183474) (← links)
- Maximality preserving bisimulation (Q1193655) (← links)
- Towards an algebra for timed behaviours (Q1199544) (← links)
- The semantics of the combination of atomized statements and parallel choice (Q1267037) (← links)
- When is partial trace equivalence adequate? (Q1333407) (← links)
- Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)
- Deciding true concurrency equivalences on safe, finite nets (Q1365677) (← links)
- The difference between splitting in \(n\) and \(n+1\) (Q1370654) (← links)
- Presheaf models for CCS-like languages (Q1399958) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- Towards a unified view of bisimulation: A comparative study (Q1575240) (← links)
- Zero-safe nets: Comparing the collective and individual token approaches. (Q1854323) (← links)
- Bisimilarity of open terms. (Q1854331) (← 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)
- Towards refinable choreographies (Q2141294) (← links)
- Synchronous and asynchronous communication(s) between three parties (Q2182658) (← links)
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- Causality versus true-concurrency (Q2465026) (← links)
- Refinement of actions for real-time concurrent systems with causal ambiguity (Q2491208) (← links)
- Petri net reactive modules (Q2503287) (← links)
- Decidability of performance equivalence for basic parallel processes (Q2503324) (← links)
- Concurrent bisimulations in Petri nets (Q2639636) (← links)
- Dynamic Causality in Event Structures (Q2827451) (← links)
- Granularity and Concurrent Separation Logic (Q3090832) (← links)
- Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems (Q3449627) (← links)
- The true concurrency of differential interaction nets (Q4577982) (← links)
- Deciding true concurrency equivalences on finite safe nets (preliminary report) (Q4630288) (← links)
- Behavioural equivalence for infinite systems — Partially decidable! (Q4633177) (← links)
- The limit of splitn-language equivalence (Q4645217) (← links)
- On logical and concurrent equivalences (Q4917082) (← links)
- Concurrency for Graph Grammars in a Petri net shell (Q4923530) (← links)
- (Q5019695) (← links)
- Behavioural characterizations of partial order logics (Q5055959) (← links)
- (Q5089270) (← links)
