Timed testing of concurrent systems
From MaRDI portal
Recommendations
Cited in
(31)- On performance congruences for process algebras
- The difference between splitting in \(n\) and \(n+1\)
- Faster asynchronous systems.
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- Partial order semantics and read arcs
- Absolute versus relative time in process algebras.
- Concurrent testing of processes
- Timing-sequence testing of parallel programs
- Taking decisions late: end-based choice combined with action refinement
- scientific article; zbMATH DE number 994050 (Why is no real title available?)
- Conformance Testing Relations for Timed Systems
- Time Unbalanced Partial Order
- Translating Testing Theories for Concurrent Systems
- On the Merits of Temporal Testers
- scientific article; zbMATH DE number 1231594 (Why is no real title available?)
- scientific article; zbMATH DE number 1231595 (Why is no real title available?)
- scientific article; zbMATH DE number 1500554 (Why is no real title available?)
- scientific article; zbMATH DE number 1515281 (Why is no real title available?)
- Efficiency of asynchronous systems and read arcs in petri nets
- Timed testing of concurrent systems
- Using Time to Add Order to Distributed Testing
- Modeling concurrency with interval traces
- Testing semantics for urgent timed process algebras
- Formal Techniques for Networked and Distributed Systems - FORTE 2003
- Formal Techniques for Networked and Distributed Systems - FORTE 2003
- Fast asynchronous systems in dense time
- On the semantics of durational actions
- Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
- A theory of processes with durational actions
- A faster-than relation for semi-Markov decision processes
- Relational structures model of concurrency
This page was built for publication: Timed testing of concurrent systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899907)