Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni MazurkiewiczWojciech Penczek, Grzegorz Rozenberg IOS Press, 2007 - 332 Honors Professor Antoni Mazurkiewicz, who during his long scientific career made fundamental contributions to theoretical computer science. This book includes contributions, which span a range of research areas, including the theory of programming, models of concurrent and distributed systems, and (de)composition methods for Pietri nets. |
Spis treści
On Preserving Structural and Behavioural Properties by Composing Net Systems on Interfaces | 31 |
A Symbolic Automaton and its Properties | 49 |
Making Petri Nets Safe and Free of Internal Transitions | 75 |
A Unifying Language for Spatial Structures | 91 |
Finitary Compositions of Twoway FiniteState Transductions | 111 |
Computing Properties of Numerical Imperative Programs by Symbolic Computation | 125 |
On Communicating Automata with Bounded Channels | 147 |
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces | 169 |
Processes of Petri Nets with Range Testing | 199 |
An Efficient Message Passing Election Algorithm based on Mazurkiewiczs Algorithm | 221 |
On Minimal Rule Sets for Almost All Binary Information Systems | 247 |
On Ethics of Mazurkiewicz Traces | 259 |
An Exercise in Concurrent Behaviour | 273 |
On Processalgebraic Verification of Asynchronous Circuits | 283 |
Towards a Framework for Modelling Behaviours of Hybrid Systems | 311 |
Kluczowe wyrazy i wyrażenia
2NGSM algebra algorithm arcs arity asynchronous circuits automata automaton B₁ behaviour bijective bounded Büchi automaton composition Computer Science concurrent consider construction corresponding data transfer service defined Definition denote deterministic digraph dind Dir(G DREQ encoding equations existentially existentially B-bounded exists finite first-order logic FO² formula function GLAC GLAG Hence induction infinite information systems input isomorphism language Lemma linear link graphs log2 M₁ marked graph Mazurkiewicz traces minimal rules modality monoid multiset N₁ node occurrence operational semantics operator output partial order Petri Nets place graphs polynomial Proc programs Proof properties Proposition protocol PSPACE PSPACE-effective PTR-nets queue reachable relation S-invariant satisfiability semantics Springer step sequence strongly connected graph structure subset temporal logic Theorem theory trace monoid trace theory transductions transition tree UDATA uind universally B-bounded UREQ variables verification vertex