A concurrency-preserving translation from time Petri nets to networks of timed automata
From MaRDI portal
Publication:453542
DOI10.1007/S10703-012-0146-4zbMATH Open1252.68200OpenAlexW2042600536MaRDI QIDQ453542FDOQ453542
Authors: Sandie Balaguer, Thomas Chatain, Stefan Haar
Publication date: 27 September 2012
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-012-0146-4
Recommendations
Cites Work
- Uppaal in a nutshell
- Computer Aided Verification
- A theory of timed automata
- Free Choice Petri Nets
- Distributed Timed Automata with Independently Evolving Clocks
- Title not available (Why is that?)
- A partial order semantics approach to the clock explosion problem of timed automata
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Model checking of time Petri nets using the state class timed automaton
- Structural translation from time Petri nets to timed automata
- Adding Invariants to Event Zone Automata
- Compositional specification of timed systems
- Automata and Logics for Timed Message Sequence Charts
- State space computation and analysis of Time Petri Nets
- When are timed automata weakly timed bisimilar to time Petri nets?
Cited In (7)
- Concurrency in Boolean networks
- A flattening algorithm for hierarchical timed automata
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis
- Automatic decomposition of Petri nets into automata networks -- a synthetic account
- ON THE CALCULATION OF THE TRANSFER FUNCTION OF TIMED EVENT PETRI NETS
- Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets
Uses Software
This page was built for publication: A concurrency-preserving translation from time Petri nets to networks of timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453542)