ENFORCING CONCURRENT TEMPORAL BEHAVIORS

DOI10.1142/S012905410600408XMaRDI QIDQ5484900zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

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

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.

Cites work

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

Cited in

(2)

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

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)