Analysis of Timed Concurrent Models Based on Testing Equivalence

Authors:
Maria V. Andreeva;Elena N. Bozhenkova;Irina B. Virbitskaite
Affiliations:
(Correspd.) Faculty of Mechanics and Mathematics, Novosibirsk State University, Novosibirsk, Russia;(Correspd.) Institute of Informatics Systems, Siberian Division of the Russian Academy of Sciences, Novosibirsk, Russia. bozhenko@iis.nsk.su;(Correspd.) Institute of Informatics Systems, Siberian Division of the Russian Academy of Sciences, Novosibirsk, Russia. virb@iis.nsk.su
Venue:
Fundamenta Informaticae
Year:
2000

Citing 25
Cited 4

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Testing equivalences for event structures

Advanced School on Mathematical models for the semantics of parallelism
Concurrency and atomicity

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
A general way to put time in Petri nets

IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
Modeling and Verification of Time Dependent Systems Using Time Petri Nets

IEEE Transactions on Software Engineering
Towards an algebra for timed behaviours

Theoretical Computer Science
Model-checking in dense real-time

Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
A theory of timed automata

Theoretical Computer Science
Time and duration in noninterleaving concurrency

Fundamenta Informaticae
Timing and causality in process algebra

Acta Informatica
Deciding Testing Equivalence for Real-Time Processes with Dense Time

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Causal Testing

MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
A constraint-oriented real-time process calculus

FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
Metric Semantics for True Concurrent Real Time

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Efficient Scaling-Invariant Checking of Timed Bisimulation

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Testing Equivalence as a Bisimulation Equivalence

Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
The Observational Power of Clocks

CONCUR '94 Proceedings of the Concurrency Theory
Layering of Real-Time Distributed Processes

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
On Specifying Real-Time Systems in a Causality-Based Setting

FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Performance Evaluation of Systems Using Nets

Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Decidability of Bisimulation Equivalences for Parallel Timer Processes

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Efficient Verification of Parallel Real-Time Systems

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
An introduction to event structures

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
An Overview and Synthesis on Timed Process Algebras

Proceedings of the Real-Time: Theory in Practice, REX Workshop

Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Open Maps and Observational Equivalences for Timed Partial Order Models

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
A categorical observation of timed testing equivalence

PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Composition methods for constructing characteristic formulas for dense-time models

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

The intention of the paper is to extend the testing methodology to a model of event structures with a dense time domain. Alternative characterizations of timed testing relations are provided. We also present algorithms for deciding timed testing for a subclass of the model under consideration. The key to our decision algorithms is that timed testing equivalences can be reduced to appropriate symbolic bisimulations.