TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
DOI10.1016/J.TCS.2013.07.011zbMATH Open1359.68216OpenAlexW1994070444MaRDI QIDQ2453531FDOQ2453531
Authors: Joakim Byg, Morten Jacobsen, Lasse Jacobsen, Kenneth Yrke Jørgensen, Mikael H. Møller, Jiří Srba 
Publication date: 10 June 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.011
Recommendations
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)
Cites Work
- TAPAAL 2.0: integrated development environment for timed-arc Petri nets
- Formal Methods for the Design of Real-Time Systems
- Formal Methods for the Design of Real-Time Systems
- Computer Aided Verification
- A theory of timed automata
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
- Formal Modeling and Analysis of Timed Systems
- Title not available (Why is that?)
- TCTL model checking of time Petri nets
- Title not available (Why is that?)
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Compositional specification of timed systems
- Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
- Title not available (Why is that?)
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
- Title not available (Why is that?)
- Verification of Timed-Arc Petri Nets
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Title not available (Why is that?)
- Advances in verification of time Petri nets and timed automata. A temporal logic approach.
- Using forward reachability analysis for verification of timed Petri nets
- Applications and Theory of Petri Nets 2005
Cited In (6)
- From Time Petri Nets to Timed Automata: An Untimed Approach
- A concurrency-preserving translation from time Petri nets to networks of timed automata
- Verification and parameter synthesis for real-time programs using refinement of trace abstraction
- Applications and Theory of Petri Nets 2005
- TAPAAL 2.0: integrated development environment for timed-arc Petri nets
- Structural translation from time Petri nets to timed automata
Uses Software
This page was built for publication: TCTL-preserving translations from timed-arc 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 Q2453531)
