scientific article; zbMATH DE number 1332671

zbMATH Open0924.68124MaRDI QIDQ4259992FDOQ4259992

Authors: Orna Kupferman, Moshe Y. Vardi 

Publication date: 8 September 1999

Full work available at URL: http://www.cs.uchicago.edu/publications/cjtcs/articles/1998/2/contents.html

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

Recommendations

• On the complexity of verifying concurrent transition systems
• On the complexity of verifying concurrent transition systems
• Fair simulation
• Logic for Programming, Artificial Intelligence, and Reasoning
• Fair simulation

zbMATH Keywords

program verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (9)

• Automatic discovery of fair paths in infinite-state transition systems
• Title not available (Why is that?)
• Fairness of transitions in diagnosability of discrete event systems
• PSPACE-completeness of modular supervisory control problems
• Theoretical Aspects of Computing – ICTAC 2005
• On the complexity of verifying concurrent transition systems
• Checking history-determinism is NP-hard for parity automata
• Logic for Programming, Artificial Intelligence, and Reasoning
• Simulation relations and applications in formal methods

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