scientific article; zbMATH DE number 2086795

zbMATH Open1057.68641MaRDI QIDQ4737366FDOQ4737366

Authors: Piotr Dembinski, Wojciech Penczek, Agata Półrola 

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?)

Recommendations

• Automatic verification of finite-state concurrent systems using temporal logic specifications
• scientific article; zbMATH DE number 1799517
• 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

Mathematics Subject Classification ID

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

Cited In (8)

• Towards Efficient Verification of Systems with Dynamic Process Creation
• Verifying of interface assertions for infinite state Mealy machines
• Projecting transition systems: overcoming state explosion in concurrent system verification
• Exploiting symmetry for efficient verification of infinite-state component-based systems
• Unfolding Concurrent Well-Structured Transition Systems
• Model checking in bits and pieces
• Title not available (Why is that?)
• Automatic and hierarchical verification for concurrent 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)