scientific article; zbMATH DE number 1884408
From MaRDI portal
Publication:4798028
zbMath1007.68507MaRDI QIDQ4798028
Publication date: 18 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2171/21710262.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Data encryption (aspects in computer science) (68P25)
Related Items (6)
Nominal Automata for Resource Usage Control ⋮ Regular and context-free nominal traces ⋮ Decidability and complexity of Petri nets with unordered data ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication ⋮ Manipulating Trees with Hidden Labels
This page was built for publication: