Time-based expressivity of time Petri nets for system specification

DOI10.1016/S0304-3975(98)00008-5zbMath0914.68145OpenAlexW2074016802MaRDI QIDQ1285652

Andrea Maggiolo-Schettini, Antonio Cerone

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00008-5

zbMATH Keywords

semanticsexpressive powertime-critical systemsformal languagetime(d) Petri net

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)

Related Items (10)

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ Unnamed Item ⋮ Automating the transformation-based analysis of visual languages ⋮ Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format ⋮ Removing dead transitions in timed-arc Petri nets ⋮ Combining free choice and time in Petri nets ⋮ Behaviour equivalent max-plus automata for timed Petri nets under open-loop race-policy semantics ⋮ Time-based expressivity of time Petri nets for system specification ⋮ Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency) ⋮ Strong behavioral similarities in timed-arc Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of some problems in Petri nets
• Time-based expressivity of time Petri nets for system specification
• Infinite behaviour of Petri nets
• Timing Requirements for Time-Driven Systems Using Augmented Petri Nets
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Recoverability of Communication Protocols--Implications of a Theoretical Study

This page was built for publication: Time-based expressivity of time Petri nets for system specification