scientific article; zbMATH DE number 1231616
From MaRDI portal
Publication:4222939
Recommendations
Cited in
(31)- A theory of structural stationarity in the \(\pi\)-calculus
- Coalgebraic minimization of HD-automata for the -calculus using polymorphic types
- A general mathematics of names
- Causality versus true-concurrency
- Comparing operational models of name-passing process calculi
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
- History-preserving bisimilarity for higher-dimensional automata via open maps
- A class of automata for the verification of infinite, resource-allocating behaviours
- A name abstraction functor for named sets
- Families of symmetries as efficient models of resource binding
- Local model checking in a logic for true concurrency
- Algorithmic nominal game semantics
- A Petri net interpretation of open reconfigurable systems
- Modeling actor systems using dynamic I/O automata
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
- Nominal Kleene coalgebra
- Causal trees, finally
- A Category of Explicit Fusions
- Ugo Montanari and Software Verification
- History Dependent Automata for Service Compatibility
- Hard life with weak binders
- Deadlock detection in linear recursive programs
- A general account of coinduction up-to
- On-the-fly bisimilarity checking for fresh-register automata
- Symmetries, local names and dynamic (de)-allocation of names
- Modal logics for mobile processes revisited
- Bisimilarity in fresh-register automata
- Register automata with permutations
- A coalgebraic semantics for causality in Petri nets
- A framework for the verification of infinite-state graph transformation systems
- A compositional Petri net translation of general -calculus terms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222939)
