Theoretical computer science. Petri nets.

zbMath1137.68452MaRDI QIDQ927095

Harro Wimmel, Lutz Priese

Publication date: 22 May 2008

Published in: Springer-Lehrbuch (Search for Journal in Brave)

zbMATH Keywords

Petri netsreachability problemPetri net languagesPomsets

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (10)

A completeness theorem for symmetric product phase spaces ⋮ Petri-net-based 2D design of DNA walker circuits ⋮ Stochastic Petri net models of \(\text{Ca}^{2+}\) signaling complexes and their analysis ⋮ 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 ⋮ IDD-based model validation of biochemical networks ⋮ A phase semantics for polarized linear logic and second order conservativity ⋮ Towards massively parallel computations in algebraic geometry ⋮ Extended Stochastic Petri Nets for Model-Based Design of Wetlab Experiments ⋮ LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE ⋮ Completeness of MLL proof-nets w.r.t. weak distributivity

This page was built for publication: Theoretical computer science. Petri nets.