Time-abstracted bisimulation: Implicit specifications and decidability

DOI10.1006/inco.1997.2623zbMath0887.68068OpenAlexW1967761514MaRDI QIDQ1363777

Yi Wang, Kim Guldstrand 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)

Related Items (18)

Performance Model Checking Scenario-Aware Dataflow ⋮ Task automata: Schedulability, decidability and undecidability ⋮ SetExp: a method of transformation of timed automata into finite state automata ⋮ Weak bisimulation for probabilistic timed automata ⋮ A survey of timed automata for the development of real-time systems ⋮ Simulation relations and applications in formal methods ⋮ revTPL: The Reversible Temporal Process Language ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ A new method for centralised and modular supervisory control of real-time discrete event systems ⋮ Automatic synthesis of real time systems ⋮ Model checking for probabilistic timed automata ⋮ Unnamed Item ⋮ A menagerie of timed automata ⋮ Grid automata and supervisory control of dense real-time discrete event systems ⋮ Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity ⋮ Timed automata relaxation for reachability ⋮ TPAP ⋮ Bisimulation indexes and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-checking in dense real-time
• CCS expressions, finite state processes, and three problems of equivalence
• A theory of timed automata
• From ATP to timed graphs and hybrid systems
• Symbolic model checking for real-time systems

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