Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Algebraic theory of processes
Automata for modeling real-time systems
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Real-time behaviour of asynchronous agents
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Automatic verification of real-timed systems using Epsilon
PSTV '94 Proceedings of the fourteenth of a series of annual meetings on Protocol specification, testing and verification XIV
Communicating sequential processes
Communications of the ACM
An Interleaving Model for Real-Time Systems
TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Real-Time Calculi and Expansion Theorems
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Computing Distinguishing Formulas for Branching Bisimulation
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Efficient Local Correctness Checking
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Generating Diagnostic Information for Behavioral Preorders
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Timed Modal Specification - Theory and Tools
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Time Abstracted Bisimiulation: Implicit Specifications and Decidability
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
| Hi-index | 0.00 |
This paper describes a technique for generating diagnostic information for the timed bisimulation equivalence and the timed simulation preorder. More precisely, given two (parallel) networks of regular real-time processes, the technique will provide a logical formula that differentiates them in case they are not timed (bi)similar. Our method may be seen as an extension of the algorithm by Cerans for deciding timed bisimilarity in that information of time-quantities has been added sufficient for generating distinguishing formulae.