Refinement Sensitive Formal Semantics of State Machines With Persistent Choice (Q2810972): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Harald Fecher / rank
Normal rank
 
Property / author
 
Property / author: Harald Fecher / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2009.08.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109649660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation can't be traced / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrency and refinement in the unified modeling language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about time and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statecharts: a visual formalism for complex systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata for the modal μ-calculus and related results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Probabilistic Extension of UML Statecharts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Underspecification, Inherent Nondeterminism and Probability in Sequence Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Nondeterminism in Operational Models of Concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-valued abstraction: More precision at less cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating tree automata, parity games, and modal \(\mu\)-calculus / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:19, 12 July 2024

scientific article
Language Label Description Also known as
English
Refinement Sensitive Formal Semantics of State Machines With Persistent Choice
scientific article

    Statements

    Refinement Sensitive Formal Semantics of State Machines With Persistent Choice (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 June 2016
    0 references
    modeling language
    0 references
    nondeterminism
    0 references
    \(\mu\)-calculus
    0 references
    3-valued satisfaction
    0 references
    formal semantics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references