The following pages link to Angelo Morzenti (Q383725):
Displayed 22 items.
- A temporal logic for micro- and macro-step-based real-time systems: foundations and applications (Q530560) (← links)
- Modeling time in computing. (Q714629) (← links)
- Automated compositional proofs for real-time systems (Q882449) (← links)
- A theory of implementation and refinement in timed Petri nets (Q1128980) (← links)
- (Q1336750) (redirect page) (← links)
- A short note on the approximability of the maximum leaves spanning tree problem (Q1336751) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- Fast deterministic parsers for transition networks (Q1789065) (← links)
- Dealing with zero-time transitions in axiom systems. (Q1854267) (← links)
- A deterministic parsing algorithm for ambiguous regular expressions (Q2035007) (← links)
- A benchmark production tool for regular expressions (Q2177602) (← links)
- From Ambiguous Regular Expressions to Deterministic Parsing Automata (Q2947407) (← links)
- BSP: A Parsing Tool for Ambiguous Regular Expressions (Q2947431) (← links)
- Model Checking Temporal Metric Specifications with Trio2Promela (Q3508543) (← links)
- (Q4217594) (← links)
- (Q4518434) (← links)
- On the approximability of some maximum spanning tree problems (Q5096340) (← links)
- Fundamental Approaches to Software Engineering (Q5316439) (← links)
- Shift-Reduce Parsers for Transition Networks (Q5404914) (← links)
- Complexity of Extended vs. Classic LR Parsers (Q5496179) (← links)
- Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time (Q5505609) (← links)
- Formal languages and compilation (Q5891327) (← links)