A Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-30476-0_18
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Timed Failure Equivalence Preserving Abstraction for Parametric Time-Interval Automata

International Journal of Foundations of Computer Science
Computer Science
2006English

The Coarsest Congruence for Timed Automata With Deadlines Contained in Bisimulation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Liveness in L/U-Parametric Timed Automata

2017English

Timed-Automata Abstraction of Switched Dynamical Systems Using Control Invariants

Real-Time Systems
ControlSystems EngineeringOptimizationElectronic EngineeringComputer NetworksSimulationCommunicationsComputer Science ApplicationsElectricalModeling
2017English

Toward Parametric Timed Interfaces for Real-Time Components

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2014English

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Time and Action Lock Freedom Properties for Timed Automata

English

A Method for Testing Real-Time System Based on Timed Automata

Ruan Jian Xue Bao/Journal of Software
Software
2007English

History Preserving Bisimulation for Contextual Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy