A concurrency-preserving translation from time Petri nets to networks of timed automata

DOI10.1007/s10703-012-0146-4zbMath1252.68200OpenAlexW2042600536MaRDI QIDQ453542

Thomas Chatain, Stefan Haar, Sandie Balaguer

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

zbMATH Keywords

time Petri netsnetworks of timed automataconcurrency presentationtimed traces

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis ⋮ Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account ⋮ Concurrency in Boolean networks

Uses Software

• Romeo
• Kronos
• TINA
• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• Model checking of time Petri nets using the state class timed automaton
• When are timed automata weakly timed bisimilar to time Petri nets?
• A theory of timed automata
• Uppaal in a nutshell
• A partial order semantics approach to the clock explosion problem of timed automata
• Adding Invariants to Event Zone Automata
• Distributed Timed Automata with Independently Evolving Clocks
• Compositional specification of timed systems
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Free Choice Petri Nets
• Automata and Logics for Timed Message Sequence Charts
• State space computation and analysis of Time Petri Nets
• Computer Aided Verification

This page was built for publication: A concurrency-preserving translation from time Petri nets to networks of timed automata