ENFORCING CONCURRENT TEMPORAL BEHAVIORS

DOI10.1142/S012905410600408XzbMATH Open1098.68080OpenAlexW2161319638MaRDI QIDQ5484900FDOQ5484900

Authors: Doron Peled, Hongyang Qu 

Publication date: 21 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905410600408x

Recommendations

• scientific article; zbMATH DE number 2080065
• scientific article; zbMATH DE number 1796139
• Testing and verifying concurrent objects
• Verifying Concurrent Systems with Symbolic Execution
• Verifying concurrent systems with symbolic execution. Temporal reasoning is symbolic execution with a little induction.

Mathematics Subject Classification ID

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

Cites Work

• A Theorem on Boolean Matrices
• Petri nets, event structures and domains. I
• Title not available (Why is that?)
• Modeling concurrency with partial orders
• Time, clocks, and the ordering of events in a distributed system
• An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
• Notes on finite asynchronous automata
• Bisimulation and action refinement
• Well-behaved flow event structures for parallel composition and action refinement

Cited In (2)

• Calculating Probabilities of Real-Time Test Cases
• Time Unbalanced Partial Order

This page was built for publication: ENFORCING CONCURRENT TEMPORAL BEHAVIORS

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