Time-abstracted bisimulation: Implicit specifications and decidability

DOI10.1006/INCO.1997.2623MaRDI QIDQ1363777zbMATH OpenOpenAlexFDO

Authors Yi Wang, Kim G. Larsen

Publication date 11 August 1997

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/77140f0a7066733922ffc310fccd79fad424736a

zbMATH Keywords

real-time systemsbisimulation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Time abstracted bisimulation: Implicit specifications and decidability
• Analysis of timed systems using time-abstracting bisimulations
• Branching time and abstraction in bisimulation semantics
• Bisimulations for temporal logic
• Bisimulations for intuitionistic temporal logics
• A complete axiomatization of timed bisimulation for a class of timed regular behaviours
• Automated Technology for Verification and Analysis
• scientific article; zbMATH DE number 1339961
• scientific article; zbMATH DE number 1927586
• On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems

Cites work

• scientific article; zbMATH DE number 3956423 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 176736 (Why is no real title available?)
• A theory of timed automata
• CCS expressions, finite state processes, and three problems of equivalence
• From ATP to timed graphs and hybrid systems
• Model-checking in dense real-time
• Symbolic model checking for real-time systems

Cited in

(22)

• A survey of timed automata for the development of real-time systems
• A new method for centralised and modular supervisory control of real-time discrete event systems
• Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
• CONCUR 2005 – Concurrency Theory
• revTPL: The Reversible Temporal Process Language
• Behavioural equivalences for timed systems
• Automatic synthesis of real time systems
• Performance model checking scenario-aware dataflow
• SetExp: a method of transformation of timed automata into finite state automata
• Weak bisimulation for probabilistic timed automata
• Timed automata relaxation for reachability
• Task automata: Schedulability, decidability and undecidability
• TPAP: an algebra of preemptive processes for verifying real-time systems with shared resources
• Model checking for probabilistic timed automata
• Time abstracted bisimulation: Implicit specifications and decidability
• CONCUR 2005 – Concurrency Theory
• Characterize branching distance in terms of ( , )-bisimilarity
• On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems
• A menagerie of timed automata
• Grid automata and supervisory control of dense real-time discrete event systems
• Simulation relations and applications in formal methods
• Bisimulation indexes and their applications

This page was built for publication: Time-abstracted bisimulation: Implicit specifications and decidability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363777)