Campus Event Calendar: Danièle Beauquier (03/11/1997 in 46.1

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and their Model-Checking in High-Level Languages

Danièle Beauquier

Université Paris 12

AG2 Seminar

AG 1, AG 2, AG 3, INET, AG 4, AG 5, D6, RG1, SWS

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Tuesday, 11 March 97

16:15

60 Minutes

46.1 - MPII

019

Saarbrücken

Abstract

The goal of this talk is to analyse the semantics of specifications of algorithms with explicit continuous time. The goal is to find approaches for the algorithmic model-checking in high-level specification languages.

Contact

Uwe Waldmann

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Tags, Category, Keywords and additional notes

Note:

Danièle Beauquier will spend March in AG2.

Imprint / Impressum | Data Protection / Datenschutzhinweis