scientific article; zbMATH DE number 2086795

zbMATH Open1057.68641MaRDI QIDQ4737366FDOQ4737366

Agata Półrola, Piotr Dembinski, Wojciech Penczek

Publication date: 11 August 2004

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (3)

• Verifying of interface assertions for infinite state Mealy machines
• Title not available (Why is that?)
• Automatic and hierarchical verification for concurrent systems

   Recommendations

• Automatic verification of finite-state concurrent systems using temporal logic specifications 👍 👎
• Title not available (Why is that?) 👍 👎
• Automated Technology for Verification and Analysis 👍 👎
• Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings 👍 👎
• Unfolding Concurrent Well-Structured Transition Systems 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737366)