scientific article

zbMath1154.68090MaRDI QIDQ3601861

Ranko Lazić, Tom Newcomb, A. W. Roscoe, Joël Ouaknine, James Worrell

Publication date: 12 February 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (21)

On the Verification of Timed Ad Hoc Networks ⋮ Model checking Petri nets with names using data-centric dynamic systems ⋮ Linear equations for unordered data vectors in $[D^k\to{}Z^d$] ⋮ Petri Nets with Structured Data ⋮ Data Centric Workflows for Crowdsourcing ⋮ Parameterized verification of time-sensitive models of ad hoc network protocols ⋮ On termination and invariance for faulty channel machines ⋮ Unnamed Item ⋮ SMT-based verification of data-aware processes: a model-theoretic approach ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Ordinal recursive complexity of unordered data nets ⋮ Dynamic Networks of Timed Petri Nets ⋮ Decidability and complexity of Petri nets with unordered data ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ Fast computations on ordered nominal sets ⋮ The ideal view on Rackoff's coverability technique ⋮ Coverability Trees for Petri Nets with Unordered Data ⋮ Forward analysis for WSTS, part I: completions ⋮ Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication ⋮ Complexity Hierarchies beyond Elementary ⋮ Looking at mean-payoff and total-payoff through windows

This page was built for publication: