Application and Theory of Petri Nets: International Conference ... ProceedingsSpringer-Verlag, 2004 - Petri nets |
Contents
Invited papers | 1 |
Can Brute Force Be Smart? | 17 |
Better Models Better Code | 35 |
Copyright | |
20 other sections not shown
Other editions - View all
Common terms and phrases
Aalst abstract algorithm analysis arcs automata automaton behaviour bisimulation block Boolean Büchi automaton Coloured Petri Nets components composition Computer Science concurrent condition corresponding CPN Tools database defined Definition denoted enabled event example Figure finite set firing formal formula function hash function ICATPN IHTPN infinite initial marking input interface labelled language Lemma life-cycle inheritance LNCS logic M₁ marked graph method model checking modular module multiset N₁ node object life cycle object-net occurrence sequence operation output partition pomset problem Proc prod Proof properties protocol quantum quantum computers qubits reachability graph reachable markings regulatory Reisig relation represent representation semantics server signal simulation specification Springer Springer-Verlag step structure synchronisation synchronous t₁ TCTL temporal logic Theorem Theory of Petri tokens tool transformations transition relation transition system UEOS variables verification w-branching process WF-net workflow X/Open