Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View history
Purge
English
Log in
No label defined
(Q2842869)
From MaRDI portal
Jump to:
navigation
,
search
scientific article
Language
Label
Description
Also known as
English
No label defined
scientific article
Statements
instance of
scholarly article
0 references
zbMATH Open document ID
1270.68177
0 references
author
Maria Sorea
0 references
publication date
16 August 2013
0 references
full work available at URL
http://www.sciencedirect.com/science/article/pii/S1571066104805231
0 references
Mathematics Subject Classification ID
68Q60
0 references
68Q45
0 references
03B44
0 references
zbMATH DE Number
6199181
0 references
describes a project that uses
PVS
0 references
Tempo
0 references
Uppaal
0 references
ICS
0 references
Kronos
0 references
HyTech
0 references
MaRDI profile type
MaRDI publication profile
0 references
cites work
Q4817528
0 references
A theory of timed automata
0 references
Q4422082
0 references
Q4804899
0 references
Graph-Based Algorithms for Boolean Function Manipulation
0 references
Bounded model checking using satisfiability solving
0 references
Q4551177
0 references
Q4884237
0 references
Q4809077
0 references
Q4553256
0 references
HyTech: A model checker for hybrid systems
0 references
Symbolic model checking for real-time systems
0 references
Model checking of safety properties
0 references
Q4939617
0 references
Uppaal in a nutshell
0 references
Q4945220
0 references
Predicate Abstraction for Dense Real-Time Systems1 1This research was supported by the National Science Foundation under grants CCR-00-82560 and CCR-00-86096 and by NASA Langley Research Center under contract B09060051 and Cooperative Agreement NCC-1-399 with Honeywell Minneapolis. Most of this research has been conducted while the first author was visiting SRI International, July/August 2001.
0 references
Verification of Timed Automata via Satisfiability Checking
0 references
Towards Bounded Model Checking for the Universal Fragment of TCTL
0 references
Deciding Linear Inequalities by Computing Loop Residues
0 references
Safety, liveness and fairness in temporal logic
0 references
Analysis of timed systems using time-abstracting bisimulations
0 references
Sitelinks
Mathematics
(1 entry)
mardi
Publication:2842869
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Concept URI
