article

The weakest deadlock-preserving congruence

Author:

Antti ValmariAuthors Info & Claims

Information Processing Letters, Volume 53, Issue 6

Pages 341 - 346

https://doi.org/10.1016/0020-0190(94)00214-J

Published: 24 March 1995 Publication History

Abstract

No abstract available.

Cited By

View all

Valmari A(2020)All congruences below stability-preserving fair testing or CFFDActa Informatica10.1007/s00236-019-00364-457:3-5(353-383)Online publication date: 1-Oct-2020
https://dl.acm.org/doi/10.1007/s00236-019-00364-4
Bujtor FSorokin LVogler W(2016)Testing Preorders for dMTSACM Transactions on Embedded Computing Systems10.1145/298464116:2(1-28)Online publication date: 19-Dec-2016
https://dl.acm.org/doi/10.1145/2984641
Siirtola AKortelainen J(2015)Multi-parameterised compositional verification of safety propertiesInformation and Computation10.1016/j.ic.2015.08.002244:C(23-48)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.ic.2015.08.002
Show More Cited By

Index Terms

The weakest deadlock-preserving congruence

Recommendations

A Formal Framework for ASTRAL Intralevel Proof Obligations

ASTRAL is a formal specification language for real-time systems. It is intended to support formal software development, and therefore has been formally defined. This paper focuses on how to formally prove the mathematical correctness of ASTRAL ...
Compositional Semantics of a Real-Time Prototyping Language

The formal semantics of a prototyping language for hard real-time systems, PSDL, is given. PSDL provides a data flow notation augmented by application-orientation timing and control constraints to describe a system as a hierarchy of networks of ...
A refinement calculus for specifications in Hennessy-Milner logic with recursion
Abstract
This paper is about specification and verification of processes, modelled as CCS-agents. We show, by means of examples that Hennessy-Milner Logic (HML) with recursion is a suitable language for expressing implicit or partial specifications. By ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 53, Issue 6

March 24, 1995

62 pages

ISSN:0020-0190

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 24 March 1995

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Valmari A(2020)All congruences below stability-preserving fair testing or CFFDActa Informatica10.1007/s00236-019-00364-457:3-5(353-383)Online publication date: 1-Oct-2020
https://dl.acm.org/doi/10.1007/s00236-019-00364-4
Bujtor FSorokin LVogler W(2016)Testing Preorders for dMTSACM Transactions on Embedded Computing Systems10.1145/298464116:2(1-28)Online publication date: 19-Dec-2016
https://dl.acm.org/doi/10.1145/2984641
Siirtola AKortelainen J(2015)Multi-parameterised compositional verification of safety propertiesInformation and Computation10.1016/j.ic.2015.08.002244:C(23-48)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.ic.2015.08.002
Valmari A(2015)On constructibility and unconstructibility of LTS operators from other LTS operatorsActa Informatica10.1007/s00236-015-0217-252:2-3(207-234)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1007/s00236-015-0217-2
Valmari A(2012)All linear-time congruences for familiar operators part 2Proceedings of the 23rd international conference on Concurrency Theory10.1007/978-3-642-32940-1_13(162-176)Online publication date: 4-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-32940-1_13
Wolf KStahl CWeinberg DOtt JDanitz R(2011)Guaranteeing Weak Termination in Service DiscoveryFundamenta Informaticae10.5555/2362088.2362096108:1-2(151-180)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/2362088.2362096
Dunne S(2011)Termination without ✓ in CSPProceedings of the 17th international conference on Formal methods10.5555/2021296.2021326(278-292)Online publication date: 20-Jun-2011
https://dl.acm.org/doi/10.5555/2021296.2021326
Dunne S(2009)Of wlp and CSPElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2009.12.016259(35-45)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.1016/j.entcs.2009.12.016
Karvi TTienari MKaivola R(2005)Stepwise Development of Process-Algebraic Specifications in Decorated Trace SemanticsFormal Methods in System Design10.1007/s10703-005-1631-926:3(293-317)Online publication date: 1-May-2005
https://dl.acm.org/doi/10.1007/s10703-005-1631-9
Roscoe A(2004)Seeing beyond divergenceProceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years10.1007/11423348_2(15-35)Online publication date: 7-Jul-2004
https://dl.acm.org/doi/10.1007/11423348_2
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

A Formal Framework for ASTRAL Intralevel Proof Obligations

Compositional Semantics of a Real-Time Prototyping Language

A refinement calculus for specifications in Hennessy-Milner logic with recursion

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations