Weak bisimulation for probabilistic timed automata (Q606996): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.tcs.2010.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968437296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic synthesis of real time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On probabilistic timed automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward analysis of updatable timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation for Demonic Schedulers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probable innocence revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Random Choices Invisible to the Scheduler / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dining cryptographers problem: Unconditional sender and recipient untraceability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics for labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking for real-time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of real-time systems with discrete probability distributions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decidable Probability Logic for Timed Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability results for timed automata with unbounded data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and verification of long-running transactions in a timed framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-abstracted bisimulation: Implicit specifications and decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward and backward simulations. II: Timing-based systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From ATP to timed graphs and hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of Stochastic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation and Bisimulation for Probabilistic Timed Automata / rank
 
Normal rank

Latest revision as of 12:28, 3 July 2024

scientific article
Language Label Description Also known as
English
Weak bisimulation for probabilistic timed automata
scientific article

    Statements

    Weak bisimulation for probabilistic timed automata (English)
    0 references
    0 references
    0 references
    19 November 2010
    0 references
    0 references
    probabilistic timed automata
    0 references
    weak bisimulation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references