scientific article; zbMATH DE number 1956600
zbMATH Open1031.68082MaRDI QIDQ4417948FDOQ4417948
Authors: Bernard Berthomieu, François Vernadat 
Publication date: 30 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2619/26190442.htm
Title of this publication is not available (Why is that?)
Recommendations
- A state class construction for computing the intersection of time Petri nets languages
- State space computation and analysis of Time Petri Nets
- Model checking of time Petri nets using the state class timed automaton
- A state class based controller synthesis approach for time Petri nets
- scientific article; zbMATH DE number 1755141
- Branching processes of timed Petri nets
- State space analysis of Petri nets with relation-algebraic methods
- State equations and equivalent transformations for timed Petri nets
bisimulationmodel-checkingTime Petri netsstate classesreal-time systems modeling and verificationbranching time temporal properties
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (31)
- Reachability problems and abstract state spaces for time Petri nets with stopwatches
- Title not available (Why is that?)
- Approximated timed reachability graphs for the robust control of discrete event systems
- Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
- Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs
- Covering steps graphs of time Petri nets
- On-the-fly \(TCTL\) model checking for time Petri nets
- Maximally permissive controller synthesis for time Petri nets
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Delay-dependent partial order reduction technique for real time systems
- A state class based controller synthesis approach for time Petri nets
- Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net
- Probabilistic time Petri nets
- On the composition of time Petri nets
- Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties
- Model checking of time Petri nets using the state class timed automaton
- Model Checking Bounded Prioritized Time Petri Nets
- Performance evaluation of an emergency call center: tropical polynomial systems applied to timed Petri nets
- Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs
- The on-line diagnosis of time Petri nets
- Logical time control of concurrent DES
- An extremum timed extended reachability graph for temporal analysis of time Petri nets
- Dynamic exploration of multi-agent systems with periodic timed tasks
- A state class construction for computing the intersection of time Petri nets languages
- CTL* model checking for time Petri nets
- Partial order reduction for checking soundness of time workflow nets
- Shrinking of time Petri nets
- Symbolic analysis and parameter synthesis for time Petri nets using Maude and SMT solving
- SNAKES: a flexible high-level Petri nets library (tool paper)
- Timed aggregate graph: a finite graph preserving event- and state-based quantitative properties of time Petri nets
- An efficient state space construction for a class of timed automata
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417948)
