Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets

DOI10.1007/11888116_29zbMath1225.68047OpenAlexW1493490750MaRDI QIDQ3613087

Jean-Pierre Courtiat, Marc Boyer, Pierre De Saqui-Sannes, Tarek Sadani

Publication date: 11 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11888116_29

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)

Related Items

Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format ⋮ Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets

Uses Software

• Kronos
• TINA
• Uppaal
• TURTLE-P

Cites Work

• Finite representations of CCS and TCSP programs by automata and Petri nets
• Kronos: A verification tool for real-time systems
• Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets
• Nets, Terms and Formulas
• Mapping Petri nets with inhibitor arcs onto basic LOTOS behavior expressions
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item