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

DOI10.1007/S10703-012-0146-4MaRDI QIDQ453542zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

networks of timed automatatime Petri netsconcurrency presentationtimed traces

Mathematics Subject Classification ID

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

Recommendations

• Structural translation from time Petri nets to timed automata
• TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
• From Time Petri Nets to Timed Automata: An Untimed Approach
• Applications and Theory of Petri Nets 2005
• scientific article; zbMATH DE number 2088674

Cites work

• scientific article; zbMATH DE number 1515288 (Why is no real title available?)
• A partial order semantics approach to the clock explosion problem of timed automata
• A theory of timed automata
• Adding Invariants to Event Zone Automata
• Automata and Logics for Timed Message Sequence Charts
• Compositional specification of timed systems
• Computer Aided Verification
• Distributed Timed Automata with Independently Evolving Clocks
• Free Choice Petri Nets
• Model checking of time Petri nets using the state class timed automaton
• State space computation and analysis of Time Petri Nets
• Structural translation from time Petri nets to timed automata
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Uppaal in a nutshell
• When are timed automata weakly timed bisimilar to time Petri nets?

Cited in

(7)

• Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets
• A flattening algorithm for hierarchical timed automata
• Concurrency in Boolean networks
• 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

Describes a project that uses

Uses Software

• Uppaal
• TINA
• Kronos
• Romeo

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)