Recoverability of Communication Protocols--Implications of a Theoretical Study

DOI10.1109/TCOM.1976.1093424zbMath0362.68096MaRDI QIDQ4136583

Philip M. Merlin, David J. Farber

Publication date: 1976

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68N01: General topics in the theory of software

68W99: Algorithms in computer science

Related Items

The tool TINA – Construction of abstract state spaces for petri nets and time petri nets, Petri net‐based modeling and performance analysis of transaction scheduling in grid database, A time Petri net-based approach for synchronization, analysis and management of multimedia scenarios, Verifying time Petri nets by linear programming, Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL}, Petri nets for modelling metabolic pathways: a survey, On the composition of time Petri nets, On-the-fly \(TCTL\) model checking for time Petri nets, On fluidization of discrete event models: Observation and control of continuous Petri nets, A COTS-based approach for estimating performance and energy consumption of embedded real-time systems, Qualitative simulation of temporal concurrent processes using time interval Petri nets, Distributed simulation of modular time Petri nets: An approach and a case study exploiting temporal uncertainty, Hard real-time tasks' scheduling considering voltage scaling, precedence and exclusion relations, Full simulation coverage for SystemC transaction-level models of systems-on-a-chip, The synthesis of communication protocols, A theory of implementation and refinement in timed Petri nets, TIC: a tImed calculus, Mapping timed cause-effect structures into timed Petri nets, Time-based expressivity of time Petri nets for system specification, A process algebra of communicating shared resources with dense time and priorities, Faster asynchronous systems., A causal semantic for time Petri nets, A brief survey and synthesis of the roles of time in Petri nets., Efficient verification of a class of time Petri nets using linear programming, A generic causal model for place latency., Model checking of systems with many identical timed processes, Dealing with zero-time transitions in axiom systems., A wide-spectrum language for object-based development of real-time systems, CTL* model checking for time Petri nets, An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions, Fuzzy timed Petri nets - analysis and implementation, Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties, Fuzzy timed Petri net definitions, properties, and applications, A control synthesis approach for time discrete event systems, Specification and analysis of timing requirements for real-time systems in the CBD approach, Verification of Timed-Arc Petri Nets, Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets, Concurrency and Time in Role-Based Access Control, Minimal Cost Reachability/Coverability in Priced Timed Petri Nets