Pages that link to "Item:Q1363777"

The following pages link to Time-abstracted bisimulation: Implicit specifications and decidability (Q1363777):

Displaying 20 items.

• A survey of timed automata for the development of real-time systems (Q394966) (← links)
• SetExp: a method of transformation of timed automata into finite state automata (Q601048) (← links)
• Weak bisimulation for probabilistic timed automata (Q606996) (← links)
• Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity (Q1004387) (← links)
• Bisimulation indexes and their applications (Q1606119) (← links)
• Timed automata relaxation for reachability (Q2044206) (← links)
• Model checking for probabilistic timed automata (Q2248072) (← links)
• Grid automata and supervisory control of dense real-time discrete event systems (Q2489622) (← links)
• Task automata: Schedulability, decidability and undecidability (Q2643078) (← links)
• TPAP: an algebra of preemptive processes for verifying real-time systems with shared resources (Q2842574) (← links)
• (Q3121518) (← links)
• Performance Model Checking Scenario-Aware Dataflow (Q3172842) (← links)
• Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
• A new method for centralised and modular supervisory control of real-time discrete event systems (Q3550771) (← links)
• Automatic synthesis of real time systems (Q4645208) (← links)
• A menagerie of timed automata (Q5176174) (← links)
• On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems (Q5739458) (← links)
• CONCUR 2005 – Concurrency Theory (Q5897479) (← links)
• CONCUR 2005 – Concurrency Theory (Q5897489) (← links)
• revTPL: The Reversible Temporal Process Language (Q6151560) (← links)