scientific article; zbMATH DE number 1231616
From MaRDI portal
Publication:4222939
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
History-preserving bisimilarity for higher-dimensional automata via open maps ⋮ Nominal Kleene Coalgebra ⋮ A general mathematics of names ⋮ Modeling Actor Systems Using Dynamic I/O Automata ⋮ Causal Trees, Finally ⋮ On the Relationship between π-Calculus and Finite Place/Transition Petri Nets ⋮ Families of Symmetries as Efficient Models of Resource Binding ⋮ A coalgebraic semantics for causality in Petri nets ⋮ Symmetries, local names and dynamic (de)-allocation of names ⋮ A Category of Explicit Fusions ⋮ Ugo Montanari and Software Verification ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ Local Model Checking in a Logic for True Concurrency ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ Algorithmic Nominal Game Semantics ⋮ A compositional Petri net translation of general \(\pi\)-calculus terms ⋮ Causality versus true-concurrency ⋮ A Petri Net Interpretation of Open Reconfigurable Systems ⋮ A general account of coinduction up-to ⋮ Hard Life with Weak Binders ⋮ Deadlock Detection in Linear Recursive Programs ⋮ Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types ⋮ Comparing operational models of name-passing process calculi ⋮ A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours ⋮ A theory of structural stationarity in the \(\pi\)-calculus ⋮ Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus ⋮ A Name Abstraction Functor for Named Sets
This page was built for publication:
