The following pages link to (Q3805922):
Displayed 24 items.
- 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 partial ordering semantics for CCS (Q914400) (← links)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← 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)
- 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)
- 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)
- From Logic to Theoretical Computer Science – An Update (Q5452171) (← links)