Event algebra for transition systems composition application to timed automata

DOI10.1007/S00236-017-0302-9zbMath1398.68340OpenAlexW2737761969MaRDI QIDQ1656550

Jean-Paul Bodeveix, Elie Fares, Mamoun Filali

Publication date: 10 August 2018

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://oatao.univ-toulouse.fr/22304/1/Fares_22304.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Event algebra for transition systems composition application to timed automata ⋮ A Theory Agenda for Component-Based Design

Uses Software

• Coq
• Uppaal
• Fiacre
• Rodin
• Esterel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rule formats for determinism and idempotence
• Model-checking in dense real-time
• Calculi for synchrony and asynchrony
• The Esterel synchronous programming language: Design, semantics, implementation
• A theory of timed automata
• Symbolic model checking for real-time systems
• Event algebra for transition systems composition application to timed automata
• Abstract behavior types: a foundation model for components and their composition
• A Modal Interface Theory for Component-based Design
• Extending modal transition systems with structured labels
• Probabilistic Weighted Automata
• A Rule Format for Associativity
• A Notion of Glue Expressiveness for Component-Based Systems
• Compositional Abstraction in Real-Time Model Checking
• Separation Logic Semantics for Communicating Processes
• Formal Methods for the Design of Real-Time Systems
• Lectures on Concurrency and Petri Nets
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Event algebra for transition systems composition application to timed automata