A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104378808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for process generating context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3761680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing finite Kripke structures in propositional temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three logics for branching bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for deciding bisimilarity of normed context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of bisimilarity for Petri nets and some related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimulation-like equivalences with finite-state processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite representations of infinite-state behaviours / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Logical Viewpoint on Process-algebraic Quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation preorder over simple process algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4673421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regular viewpoint on PA-processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of model checking with the temporal logic EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying lossy channel systems has nonprimitive recursive complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(A)=L(B)\)? decidability results from complete formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic formulae for processes with divergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossible futures and determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472439 / rank
 
Normal rank

Latest revision as of 20:18, 24 June 2024

scientific article
Language Label Description Also known as
English
A general approach to comparing infinite-state systems with their finite-state specifications
scientific article

    Statements

    A general approach to comparing infinite-state systems with their finite-state specifications (English)
    0 references
    0 references
    0 references
    13 September 2006
    0 references
    verification
    0 references
    semantic equivalences
    0 references
    infinite-state systems
    0 references
    modal logic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers