scientific article; zbMATH DE number 1863166

zbMath1006.68081MaRDI QIDQ4791837

Keijo Heljanko

Publication date: 3 February 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2154/21540218.htm

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 (5)

A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking ⋮ Bounded Synthesis for Petri Games ⋮ Exploiting step semantics for efficient bounded model checking of asynchronous systems ⋮ Planning as satisfiability: parallel plans and algorithms for plan search ⋮ Using transition set sequences to partition behaviors of Petri nets

This page was built for publication: