The following pages link to (Q4222939):
Displaying 26 items.
- History-preserving bisimilarity for higher-dimensional automata via open maps (Q265804) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- Symmetries, local names and dynamic (de)-allocation of names (Q618165) (← links)
- A coalgebraic semantics for causality in Petri nets (Q890619) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- A compositional Petri net translation of general \(\pi\)-calculus terms (Q939164) (← links)
- A theory of structural stationarity in the \(\pi\)-calculus (Q1014276) (← links)
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types (Q1770362) (← links)
- A general mathematics of names (Q2373874) (← links)
- Causality versus true-concurrency (Q2465026) (← links)
- Comparing operational models of name-passing process calculi (Q2495643) (← links)
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus (Q2566037) (← links)
- A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours (Q2811927) (← links)
- A Name Abstraction Functor for Named Sets (Q2873662) (← links)
- Families of Symmetries as Efficient Models of Resource Binding (Q2919450) (← links)
- Local Model Checking in a Logic for True Concurrency (Q2988383) (← links)
- Algorithmic Nominal Game Semantics (Q3000592) (← links)
- A Petri Net Interpretation of Open Reconfigurable Systems (Q3011889) (← links)
- Modeling Actor Systems Using Dynamic I/O Automata (Q3179176) (← links)
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets (Q3184693) (← links)
- Nominal Kleene Coalgebra (Q3449483) (← links)
- Causal Trees, Finally (Q3460861) (← links)
- A Category of Explicit Fusions (Q3507388) (← links)
- Ugo Montanari and Software Verification (Q3507392) (← links)
- Hard Life with Weak Binders (Q5170666) (← links)
- Deadlock Detection in Linear Recursive Programs (Q5175772) (← links)