Algebraic theory of processes
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Process algebra for performance evaluation
Theoretical Computer Science
Process Algebra with Timing
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
Encoding PAMR into (Timed) EFSMs
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Generating Test Cases for a Timed I/O Automaton Model
Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
Timed Petri nets and preliminary performance evaluation
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
A technique to generate feasible tests for communications systems with multiple timers
IEEE/ACM Transactions on Networking (TON)
Formal Aspects of Computing
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A guided method for testing timed input output automata
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Testing real-time multi input-output systems
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Extending EFSMs to specify and test timed systems with action durations and timeouts
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Conformance testing relations for timed systems
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Passive Testing of Timed Systems
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Formal passive testing of timed systems: theory and tools
Software Testing, Verification & Reliability
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
| Hi-index | 0.00 |
We present a formal framework to specify and test systems presenting both soft and hard deadlines. While hard deadlines must be always met on time, soft deadlines can be sometimes met in a different time, usually higher, from the specified one. It is this characteristic (to formally define sometimes) what produces several reasonable alternatives to define appropriate implementation relations, that is, relations to decide wether an implementation is correct with respect to a specification. In addition to introduce these relations, we define a testing framework to test implementations.