Modeling and proving GRAFCETS With Transition Systems - Université de Bretagne Occidentale Access content directly
Book Sections Year : 2007

Modeling and proving GRAFCETS With Transition Systems

Abstract

In this paper, we present two methods to modelize a grafcet program with transition systems We give some properties that this model should satisfy and we check them with the tool MEC

Domains

Formal Languages and Automata Theory [cs.FL]

Philippe Le Parc  : Connect in order to contact the contributor

https://hal.univ-brest.fr/hal-00502042

Submitted on : Tuesday, July 13, 2010-10:16:47 AM

Last modification on : Monday, October 11, 2021-2:22:45 PM

No file

Dates and versions

hal-00502042 , version 1 (13-07-2010)

Identifiers

  • HAL Id : hal-00502042 , version 1

Cite

Dominique L'Her, Philippe Le Parc, Lionel Marcé. Modeling and proving GRAFCETS With Transition Systems. Real-time-systems. Modeling, design and applications. Selected papers based on the presentations at the AMAST workshops. Hackensack, NJ: AMAST Series in Computing 8., World Scientific (ISBN 981-02-4424-X/hbk), pp.77-96, 2007. ⟨hal-00502042⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-BREST
58 View
0 Download

Share

Gmail Facebook X LinkedIn More