Publication:4222939
From MaRDI portal
zbMath0925.68289MaRDI QIDQ4222939
Publication date: 6 January 1999
Full work available at URL: http://www.elsevier.com/cas/tree/store/tcs/free/entcs/store/contents.htt?jrnl=tcs&sctn=entcs&mode=sub&vol=10#10014
Related Items
Hard Life with Weak Binders, Deadlock Detection in Linear Recursive Programs, On-the-fly bisimilarity checking for fresh-register automata, History-preserving bisimilarity for higher-dimensional automata via open maps, A general account of coinduction up-to, Symmetries, local names and dynamic (de)-allocation of names, 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 \(\pi\)-calculus terms, A theory of structural stationarity in the \(\pi\)-calculus, Coalgebraic minimization of HD-automata for the \(\pi\)-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, 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
