Precongruence formats for decorated trace semantics

Authors:
Bard Bloom;Wan Fokkink;Rob J. van Glabbeek
Affiliations:
IBM T.J. Watson Research Center, Hawthorne, NY;CWI and Free University Amsterdam, Amsterdam, The Netherlands;Stanford University, Stanford, CA
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2004

Citing 28
Cited 13

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Specification-oriented semantics for communicating processes

Acta Informatica
Refusal testing

Theoretical Computer Science
Ready-trace semantics for concrete process algebra with the priority operator

The Computer Journal
Readies and failures in the algebra of communicating processes

SIAM Journal on Computing
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Bisimulation through probabilistic testing

Information and Computation
Structured operational semantics and bisimulation as a congruence

Information and Computation
Transition system specifications with negative premises

Theoretical Computer Science
Bisimulation can't be traced

Journal of the ACM (JACM)
Ntyft/ntyxt rules reduce to ntree rules

Information and Computation
The meaning of negative premises in transition system specifications

Journal of the ACM (JACM)
The algebra of communicating processes with empty process

ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Rooted branching bisimulation as a congruence

Journal of Computer and System Sciences
Language preorder as a precongruence

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
A Calculus of Communicating Systems

A Calculus of Communicating Systems
A congruence theorem for structured operational semantics with predicates and negative premises

Nordic Journal of Computing
Results on the Propositional µ-Calculus

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Linear and Branching Structures in the Semantics and Logics of Reactive Systems

Proceedings of the 12th Colloquium on Automata, Languages and Programming
A Congruence Theorem for Structured Operational Semantics with Predicates

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
The Meaning of Negative Premises in Transition System Specifications II

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Full Abstraction in Structural Operational Semantics (Extended Abstract)

AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Precongruence Formats for Decorated Trace Preorders

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Ready, Set, Go: Structural Operational Semantics for Linear-Time Process Algebras

Ready, Set, Go: Structural Operational Semantics for Linear-Time Process Algebras
A menagerie of non-finitely based process semantics over BPA* - from ready simulation to completed traces

Mathematical Structures in Computer Science

Compositionality of Hennessy-Milner logic by structural operational semantics

Theoretical Computer Science - Foundations of computation theory (FCT 2003)
SOS formats and meta-theory: 20 years after

Theoretical Computer Science
Bialgebraic methods and modal logic in structural operational semantics

Information and Computation
From Bialgebraic Semantics to Congruence Formats

Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of SOS Rule Formats

Electronic Notes in Theoretical Computer Science (ENTCS)
Divide and Congruence Applied to η-Bisimulation

Electronic Notes in Theoretical Computer Science (ENTCS)
Divide and congruence: from decomposition of modalities to preservation of branching bisimulation

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
A finite basis for failure semantics

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity

Information and Computation
Decompositional reasoning about the history of parallel processes

FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Parameterized preorder relations for model-based testing of software product lines

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Modular semantics for transition system specifications with negative premises

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labeled transition systems, and formats of transition system specifications using Plotkin's structural approach. For several preorders in the linear time---branching time spectrum a format is given, as general as possible, such that this preorder is a precongruence for all operators specifiable in that format. The formats are derived using the modal characterizations of the corresponding preorders.