2011 · 32 citations · 17 references
ComputingComputer ScienceFormal MethodsStochastic ProcessesAutomata TheoryFinite AutomataFinite-state MachinesSpecification LanguagesTemporal LogicVerificationAutomata In Formal VerificationDiscrete-event ModelingDiscrete-event SystemsHybrid AutomataHybrid LogicLinear Temporal LogicTemporal Logic Verification
We introduce the Hybrid Automata Stochastic Logic HASL, a new temporal logic formalism for the verification of discrete event stochastic processes (DESP). HASL employs Linear Hybrid Automata (LHA) as machineries to select prefixes of relevant execution paths of a DESP. The advantage with
17
Some algebraic and geometric computations in PSPACE
John Canny · 1988 · 581 citations · Full text
Model-checking continuous-time Markov chains
Adnan Aziz, Kumud Sanwal, Vigyan Singhal et al. · ACM Transactions on Computational Logic · 2000 · 415 citations