Amanote Research

Amanote Research

    RegisterSign In

Equivalence Notions for Concurrent Systems and Refinement of Actions

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-51486-4_71
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1989

Authors
Rob GlabbeekUrsula Goltz
Publisher

Springer Berlin Heidelberg


Related search

Stochastic Equivalence for Performance Analysis of Concurrent Systems in dtsiPBC

Siberian Electronic Mathematical Reports
Mathematics
2017English

Notions of Spanning Surface Equivalence

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1976English

Equivalence and Strong Equivalence of Actions on Handlebodies

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Equivalence and Strong Equivalence of Actions on Handlebodies

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Relaxed Notions of Schema Mapping Equivalence Revisited

2011English

Refinement of Timing Constraints for Concurrent Tasks With Scheduling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Understanding Structure of Concurrent Actions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Behavioural Notions for Elementary Net Systems

DAIMI Report Series
1989English

Verification of Concurrent Quantum Protocols by Equivalence Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy