scientific article; zbMATH DE number 1755138
From MaRDI portal
Publication:4535172
zbMath0986.68092MaRDI QIDQ4535172
Aletta Nylén, Parosh Aziz Abdulla
Publication date: 13 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2075/20750053
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A counter abstraction technique for verifying properties of probabilistic swarm systems, On the Verification of Timed Ad Hoc Networks, Linear equations for unordered data vectors in $[D^k\to{}Z^d$], Weak Time Petri Nets Strike Back!, Model checking of time Petri nets using the state class timed automaton, Waiting nets, Unnamed Item, Performance Evaluation of an Emergency Call Center: Tropical Polynomial Systems Applied to Timed Petri Nets, Waiting Nets: State Classes and Taxonomy, Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets, TCTL-preserving translations from timed-arc Petri nets to networks of timed automata, Timed Basic Parallel Processes, Universal safety for timed Petri nets is PSPACE-complete, When are timed automata weakly timed bisimilar to time Petri nets?, Parameterized model checking of networks of timed automata with Boolean guards, Timed Petri nets and timed automata: On the discriminating power of Zeno sequences, Dynamic Networks of Timed Petri Nets, A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets, WQO dichotomy for 3-graphs, On-the-fly \(TCTL\) model checking for time Petri nets, Minimal Cost Reachability/Coverability in Priced Timed Petri Nets, Combining free choice and time in Petri nets, Verification of Timed-Arc Petri Nets, Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture, Decidable Classes of Unbounded Petri Nets with Time and Urgency, Complexity Hierarchies beyond Elementary, Monotonic Abstraction in Parameterized Verification, Strong behavioral similarities in timed-arc Petri nets
Uses Software
