The following pages link to (Q3805922):
Displaying 50 items.
- History-preserving bisimilarity for higher-dimensional automata via open maps (Q265804) (← links)
- Reduction of event structures under history preserving bisimulation (Q338613) (← links)
- Models for name-passing processes: Interleaving and causal (Q598191) (← links)
- Modelling causality via action dependencies in branching time semantics (Q671596) (← links)
- Location equivalence in a parametric setting (Q672708) (← 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)
- A coalgebraic semantics for causality in Petri nets (Q890619) (← links)
- A partial ordering semantics for CCS (Q914400) (← links)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
- A completed hierarchy of true concurrent equivalences (Q1029093) (← links)
- Connectedness and synchronization (Q1179707) (← links)
- Maximality preserving bisimulation (Q1193655) (← links)
- Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)
- Deciding true concurrency equivalences on safe, finite nets (Q1365677) (← links)
- On schematological equivalence of partially interpreted dataflow networks (Q1373139) (← links)
- Presheaf models for CCS-like languages (Q1399958) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- Process languages and nets (Q1575245) (← links)
- Conflict vs causality in event structures (Q1996864) (← links)
- A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
- Behavioural logics for configuration structures (Q2123053) (← 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)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- Refinement of actions for real-time concurrent systems with causal ambiguity (Q2491208) (← links)
- On the expressiveness of higher dimensional automata (Q2491631) (← links)
- Concurrent bisimulations in Petri nets (Q2639636) (← links)
- Characterising spectra of equivalences for event structures, logically (Q2672268) (← links)
- Local Model Checking in a Logic for True Concurrency (Q2988383) (← links)
- (Q3385652) (← links)
- Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP (Q3449628) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- An extension of the notions of traces and of asynchronous automata (Q3988805) (← links)
- The true concurrency of differential interaction nets (Q4577982) (← links)
- Deciding true concurrency equivalences on finite safe nets (preliminary report) (Q4630288) (← links)
- On logical and concurrent equivalences (Q4917082) (← links)
- On relating some models for concurrency (Q5044721) (← links)
- Minimal transition systems for history-preserving bisimulation (Q5048942) (← links)
- (Q5089270) (← links)
- On nets, algebras and modularity (Q5096217) (← links)
- Temporal structures (Q5096250) (← links)
- Dynamic matrices and the cost analysis of concurrent programs (Q5096393) (← links)
- Read-write causality (Q5096915) (← links)
- Bisimilarity of Diagrams (Q5098713) (← links)
- Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
