Pages that link to "Item:Q4671274"
From MaRDI portal
The following pages link to The tool TINA – Construction of abstract state spaces for petri nets and time petri nets (Q4671274):
Displaying 36 items.
- Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL} (Q440685) (← links)
- A concurrency-preserving translation from time Petri nets to networks of timed automata (Q453542) (← links)
- Diagnosability analysis of patterns on bounded labeled prioritized Petri nets (Q513189) (← links)
- On the composition of time Petri nets (Q645045) (← links)
- Accelerating the computation of dead and concurrent places using reductions (Q832013) (← links)
- State observer for DES under partial observation with time Petri nets (Q839012) (← links)
- Reachability problems and abstract state spaces for time Petri nets with stopwatches (Q884758) (← links)
- Investigating the usability of real-time scheduling theory with the Cheddar project (Q1033676) (← links)
- Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions (Q1941851) (← links)
- Verification of hypercube communication structures via parametric Petri nets (Q1956980) (← links)
- Diagnosability verification using LTL model checking (Q2081084) (← links)
- Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis (Q2128086) (← links)
- Petri nets semantics of reaction rules (RR). A language for ecosystems modelling (Q2165237) (← links)
- Model checking Petri nets with MSVL (Q2279737) (← links)
- Sequential composition of linear systems' clans (Q2279738) (← links)
- Nested-unit Petri nets (Q2423743) (← links)
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata (Q2453531) (← links)
- Towards a formal semantics for UML/MARTE state machines based on hierarchical timed automata (Q2637308) (← links)
- Improvements in unfolding of colored Petri nets (Q2695488) (← links)
- Dynamical modeling and analysis of large cellular regulatory networks (Q2787874) (← links)
- Universality in Infinite Petri Nets (Q2945886) (← links)
- Verification of Timed-Arc Petri Nets (Q3075507) (← links)
- Universal Sleptsov net (Q3177465) (← links)
- Model Checking Bounded Prioritized Time Petri Nets (Q3510821) (← links)
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
- Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format (Q3605462) (← links)
- Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets (Q3613087) (← links)
- Design of Optimal Petri Net Supervisors for Flexible Manufacturing Systems via Weighted Inhibitor Arcs (Q4575107) (← links)
- Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks (Q4988953) (← links)
- A CTL* Model Checker for Petri Nets (Q5100762) (← links)
- Covering Steps Graphs of Time Petri Nets (Q5179058) (← links)
- Adaptation of Open Component-Based Systems (Q5428909) (← links)
- Petri Net Reductions for Counting Markings (Q5883572) (← links)
- Methods for Efficient Unfolding of Colored Petri Nets (Q6070614) (← links)
- Sleptsov nets are Turing-complete (Q6138839) (← links)
- Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques (Q6160740) (← links)