A Logical Viewpoint on Process-Algebraic Quotients

Authors:
Antonín Kucera;Javier Esparza
Affiliations:
-;-
Venue:
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Year:
1999

Citing 15
Cited 1

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Three partition refinement algorithms

SIAM Journal on Computing
A theory of timed automata

Theoretical Computer Science
On finite representations of infinite-state behaviours

Information Processing Letters
Communication and Concurrency

Communication and Concurrency
Simulation Preorder on Simple Process Algebras

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Hybrid Automata with Finite Bisimulatioins

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Deciding Finiteness of Petri Nets Up To Bisimulation

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
The Linear Time-Branching Time Spectrum (Extended Abstract)

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Propositional Temporal Logics and Equivalences

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Checking Regular Properties of Petri Nets

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Bisimulation Collapse and the Process Taxonomy

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Regularity is Decidable for Normed PA Processes in Polynomial Time

Proceedings of the 16th 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

Game Characterizations of Process Equivalences

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the following problem: Given a transition system T and its quotient T/∼ under an equivalence ∼, which are the sets L, L′ of Hennessy-Milner formulae such that: if Τ ∈ L and T satisfies Τ, then T/∼ satisfies Τ if Τ ∈ L′ and T/∼ satisfies Τ, then T satisfies Τ.